411 REFERENCE · Wikibooks
Modular Arithmetic/Sophie Germain's Theorem
Reference material by Wikibooks contributors. This retains its source identity and is not 411 news reporting.
Sophie Germain’s Theorem Let be a prime number. Then, for the equation,
it is true that at least one of the numbers must be divisible by , if and only if there exists a prime , such that:
No two nonzero powers differ by one modulo
;
is itself not a power modulo .
Corollary: The first case of Fermat's Last Theorem (the case in which does not divide ) must hold for every prime if there exists a prime for which (1) and (2) hold.