olymmath

Putnam 1997 B5

  • Session B

Prove that for n≥2n \geq 2, 22⋅⋅2⏟n terms≡22⋅⋅2⏟n−1 terms(modn).\underbrace{2^{2^{\cdot^{\cdot^{2}}}}}_{n \text{ terms}} \equiv \underbrace{2^{2^{\cdot^{\cdot^{2}}}}}_{n-1 \text{ terms}} \pmod{n}.

Dataset text Putnam 1995 to 2025. Quoted with source.

Solutions

Human solution Solution 1 by Manjul Bhargava, Kiran Kedlaya and Lenny Ng

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

These problems have the most words in common with this statement.

Locator putnam/1997/b5 · Tag R8JRA7M79D · Edit this page on GitHub · Keys: j next, k previous