Maths Olympiad Prep

Library / /9 of 151

, 2025

Number theory Difficulty 5.0 AIME, harder Prove it Hungary

Let a3a \geq 3 be an integer, and define f(n)=an1f(n) = a^n - 1 for every positive integer nn. Denote by f(k)f^{(k)} the kk-iterate of ff, that is, f(1)(n)=f(n)f^{(1)}(n) = f(n) and f(k+1)(n)=f(f(k)(n))f^{(k+1)}(n)=f(f^{(k)}(n)) for k1k \geq 1.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.