olymmath

OBM 2022 Problem 5

    Let nn be a positive integer number. Define S(n)S(n) to be the least positive integer such that S(n)≡n(mod2)S(n) \equiv n \pmod{2} , S(n)≥nS(n) \geq n , and such that there are not positive integers numbers k,x1,x2,...,xkk,x_1,x_2,...,x_k such that n=x1+x2+...+xkn=x_1+x_2+...+x_k and S(n)=x12+x22+...+xk2S(n)=x_1^2+x_2^2+...+x_k^2 . Prove that there exists a real constant c>0c>0 and a positive integer n0n_0 such that, for all n≥n0n \geq n_0 , S(n)≥cn32S(n) \geq cn^{\frac{3}{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 br-obm/2022/p5 · Tag SB0JWMKZV6 · Edit this page on GitHub · Keys: j next, k previous