KöMaL 2017 B4869
Let be a finite set of real numbers. A partition of the elements of into at least two subsets is said to be a tiling if the (pairwise disjoint) subsets have at least two elements each, and are obtained from each other by a translation. Prove that has an even number of tilings.
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.