olymmath

IMO 1988 Problem 2

  • Day 1

Let nn be an even positive integer. Let A1,A2,…,An+1A_1, A_2, \ldots, A_{n + 1} be sets having nn elements each such that any two of them have exactly one element in common while every element of their union belongs to at least two of the given sets. For which nn can one assign to every element of the union one of the numbers 0 and 1 in such a manner that each of the sets has exactly n2\frac {n}{2} zeros?

Dataset text AI-MO AoPS. Quoted with source.

Official text: IMO 1988 official English paper, page 1.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator imo/1988/p2 · Tag TVQ94JC006 · Edit this page on GitHub · Keys: j next, k previous