olymmath

Putnam 2000 A2

  • Session A

Prove that there exist infinitely many integers nn such that n,n+1,n+2n,n+1,n+2 are each the sum of the squares of two integers. [Example: 0=02+020=0^2+0^2, 1=02+121=0^2+1^2, 2=12+122=1^2+1^2.]

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/2000/a2 · Tag 3W0J4ZBR95 · Edit this page on GitHub · Keys: j next, k previous