olymmath

ELMO SL 2012 N3

    Let s(k)s(k) be the number of ways to express kk as the sum of distinct 2012th2012^{th} powers, where order does not matter. Show that for every real number cc there exists an integer nn such that s(n)>cns(n)>cn .

    Alex Zhu.

    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 elmo-sl/2012/n3 · Tag SK3BH80K27 · Edit this page on GitHub · Keys: j next, k previous