olymmath

SE-SKOLORNAS 1991 Problem 5

    Show that there are infinitely many odd positive integers nn such that in binary nn has more 11 s than n2n^2 .

    Dataset text AI-MO AoPS. 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 se-skolornas/1991/p5 · Tag ED4R1QHRBD · Edit this page on GitHub · Keys: j next, k previous