Re: [math-fun] Sums of four squares

=asimovd@aol.com This formula, which I'm seeing for the first time, is amazingly interesting!

Note that the sum of divisors of n is >= n+1, with equality just when n is prime, leading to remarkably inefficient and inscrutable primality tests based on counting partitions into four squares.