If with an odd prime, then but . The multiplicative order consequently divides four and is neither one nor two, so it is four. The preceding divisibility result makes necessary.
For sufficiency, suppose and put , an even integer. Pair opposite factors in the factorial:
Wilson's theorem gives , explicitly producing a square root of minus one modulo a prime. Thus
For a prime number , every nonzero residue class has a unique multiplicative inverse modulo : Bezout identity supplies one because its representative is coprime to , and cancellation modulo a prime gives uniqueness. Pair each residue with its inverse. The only unpaired residues satisfy , so ; the Euclid lemma gives or . For odd , these are distinct. Every other pair contributes one to the product of all nonzero residues, leaving
For , as well. This proves Wilson theorem in all cases.
For an odd prime, set . Pair the upper half of the factorial with the negatives of the lower half:
If , then is even. Therefore
This constructs a square root of minus one modulo a prime explicitly.
Fermat's little theorem says that for a prime and , ; equivalently for every integer . The Wilson theorem says for a prime (and, conversely, this congruence characterizes primes among integers greater than one).
For , is a square root of minus one modulo a prime. If is odd and , Fermat's little theorem gives
so is even and . Conversely, put . Pairing with in the factorial gives . For , is even, so the Wilson theorem yields . Thus
and in the latter case supplies a solution.
For the multiplicative order assertion, divide by : , . Since and , it follows that . Minimality of the positive order excludes , hence and
In particular by Fermat's little theorem. Negative , if included, are handled by the same division using the modular inverse of .
A Fermat number in the paper has . If a prime divides , it is odd and . Squaring gives , so the order divides . It does not divide , since modulo an odd prime. Every divisor of is a power of two, so the only possibility is
If two different Fermat numbers shared a prime factor, the same element modulo that prime would have two different orders. This is impossible, proving pairwise coprimality. Also , so for every such prime is modulo . No prime modulo can occur.
A prime modulo need not occur: take . It is prime, , and . Since the order divides , the first congruence excludes every divisor of and the second excludes ; hence the order is . This is not a power of two, so is not a prime divisor of a Fermat number. The index restriction matters: the conventional extra number is outside the paper's positive- family.
Primes congruent to five modulo eight from odd squares plus four Created 2026-10-06 Updated 2026-11-05
There are infinitely many prime numbers congruent to five modulo eight. Suppose instead that they form a finite list , and put , with if the list is empty. Then is an odd number and
For every prime factor of , the integer is nonzero modulo and . Thus a square root of minus one modulo a prime exists for , which forces . All prime factors are therefore one or five modulo eight. Their product is five modulo eight, so at least one prime factor is five modulo eight. Yet none of the divides , since . This contradicts completeness of the list.