Difference between revisions of "1988 IMO Problems/Problem 2"
Durianaops (talk | contribs) (Created page with "== Problem == Let <math>n</math> be a positive integer and let <math>A_1, A_2, \cdots, A_{2n+1}</math> be subsets of a set <math>B</math>. Suppose that (a) Each <math>A_i</...") |
Durianaops (talk | contribs) (→Problem) |
||
Line 12: | Line 12: | ||
For which values of <math>n</math> can one assign to every element of <math>B</math> one of the numbers <math>0</math> and <math>1</math> in such a way that <math>A_i</math> has <math>0</math> assigned to exactly <math>n</math> of its elements? | For which values of <math>n</math> can one assign to every element of <math>B</math> one of the numbers <math>0</math> and <math>1</math> in such a way that <math>A_i</math> has <math>0</math> assigned to exactly <math>n</math> of its elements? | ||
+ | |||
+ | == See Also == | ||
+ | {{IMO box|year=1988|num-b=1|num-a=3}} |
Revision as of 06:22, 28 March 2019
Problem
Let be a positive integer and let be subsets of a set .
Suppose that
(a) Each has exactly elements,
(b) Each contains exactly one element, and
(c) Every element of belongs to at least two of the .
For which values of can one assign to every element of one of the numbers and in such a way that has assigned to exactly of its elements?
See Also
1988 IMO (Problems) • Resources | ||
Preceded by Problem 1 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 3 |
All IMO Problems and Solutions |