Intended for: May 7, 2013
Timetable
- First draft entered by Alonso del Arte on March 22, 2012 ✓
- Draft to be reviewed by March 7, 2013
- Draft to be approved by April 7, 2013
The line below marks the end of the <noinclude> ... </noinclude> section.
A007535: Smallest pseudoprime
greater than
to base
: smallest composite number
such that
is divisible by
.
-
{ 4, 341, 91, 15, 124, 35, 25, 9, 28, ... }
Here the term “pseudoprime” is derived from Fermat's little theorem (see Fermat pseudoprimes): prime numbers satisfy the specified congruence for any coprime base, but these composite numbers satisfy it for a specific base (and possibly others as well)—and hence the theorem provides a useful but not conclusive test of primality.