Let \(A=\{1,2,3,4,5,6,7\}\). We purpose to color all the subsets of \(A\) which contains 3 elements so that the condition below is taken into consideration:

"Every pair of non-intersecting subsets has different colours"

**Clarification**: If **B** and **C** are disjoint subsets of **A**, then **B** has a different colour from **C**.

What is the least possible number of colours to do that?

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

There are no comments in this discussion.