  Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum
ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An
easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as
sums of two squares.
