I came across this “one sentence” proof that every prime congruent to 1 mod 4 can be written as a sum of two squares: https://doi.org/10.2307/2323918 The proof involves constructing the following cryptic involution $$ (x, y, . . . Read more