KöMaL 2006 B3950
Let be the set of integers not greater than 2006: ={1,2,...,2006}. Let denote the number of those subsets of the set in which the number of elements divided by 32 leaves a remainder of 7, and let denote the number of those subsets of the set in which the number of elements divided by 16 leaves a remainder of 14. Prove that =2. (Based on an OKTV (National Competition) problem)
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.