olymmath

KöMaL 2012 A575

    Prove that if S⊂{1,…,n}S\subset\{1,\ldots,n\} and ∣S∣>n3|S|>\frac{n}3, then it is possible to select at most four , not necessarily distinct elements from SS, 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.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator hu-komal/2012/a575 · Tag 5K8F3Y87QT · Edit this page on GitHub · Keys: j next, k previous