KöMaL 2012 A575
Prove that if and , then it is possible to select at most four , not necessarily distinct elements from , whose sum is a power of 2.
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.