olymmath

Putnam 2025 A6

  • Session A

Let b0=0b_0 = 0 and, for n≥0n \geq 0, define bn+1=2bn2+bn+1b_{n+1} = 2b_n^2 + b_n + 1. For each k≥1k \geq 1, show that b2k+1−2b2kb_{2^{k+1}} - 2b_{2^k} is divisible by 22k+22^{2k+2} but not by 22k+32^{2k+3}.

Curated text Kedlaya Putnam archive. 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/2025/a6 · Tag VBXYNXWZ9K · Edit this page on GitHub · Keys: j next, k previous