11 Apr
2008
11 Apr
'08
11:04 p.m.
Andy wrote: << [I wrote]: << Find the set of prime numbers p such that p^2 == 1 (mod 24). If (n, 24) = 1, then n^2 == 1 (mod 24). So that would be all primes > 3.
This statement "If (n, 24) = 1, then n^2 == 1 (mod 24)" is true and easy to verify, but it is also profound. There is no number > 24 for which the corresponding statement is true. (This is also not hard to prove, but I wonder if there is a deep underlying reason it is true.) --Dan _____________________________________________________________________ "It don't mean a thing if it ain't got that certain je ne sais quoi." --Peter Schickele