MathCastle
Proof WritingChallengePigeonhole and Extremal Arguments

Pigeonhole and Extremal Arguments · Challenge problem

Claim: every positive integer nn with n≡1(mod4)n \equiv 1 \pmod 4 is a sum of two squares (00 allowed). What is the smallest counterexample?