olymmath

IMO 1992 Problem 6

For each positive integer n, S(n) is defined as the greatest integer such that for every positive integer k ≤ S(n), n2n^2 can be written as the sum of k positive squares. (a) Prove that S(n) ≤ n2n^2 - 14 for each n ≥ 4. (b) Find an integer n such that S(n) = n2n^2 - 14. (c) Prove that there are infinitely many integers n such that S(n) = n2n^2 - 14.

Community text Kalva (prase.cz mirror). 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 imo/1992/p6 · Tag HRPSV6R4AS · Edit this page on GitHub · Keys: j next, k previous