olymmath

Putnam 1991 B1

  • Session B

For each integer n≥0n \geq 0, let S(n)=n−m2S(n) = n - m^2, where mm is the greatest integer with m2≤nm^2 \leq n. Define a sequence (ak)k=0∞(a_k)_{k=0}^\infty by a0=Aa_0 = A and ak+1=ak+S(ak)a_{k+1} = a_k + S(a_k) for k≥0k \geq 0. For what positive integers AA is this sequence eventually constant?

Curated text Kedlaya Putnam archive. 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 putnam/1991/b1 · Tag 1BGZ64AX66 · Edit this page on GitHub · Keys: j next, k previous