According to
Fermat's little theorem if
is an odd prime number
then
(or, equivalently,
) is divisible by
.
A number 1$"> which is not prime, but such that is divisible by
is called a base-2 Fermat pseudoprime, or simply
a Poulet or Sarrus number.
Up to there are
1801533
Poulet numbers.
The first Poulet numbers are
341, 561, 645, 1105, 1387, 1729, 1905, 2047, 2465, 2701, 2821, 3277, 4033, 4369, 4371, 4681, 5461, 6601 more terms
Pictorial representation of remainders (mod 2, 3, ...,11) frequency. For a table of values and more details
click here
A graph displaying how many Poulet numbers are multiples of the primes
p from 2 to 71. In black the ideal line 1/
p.