Number theory
When does Fermat’s test miss a composite?
For every odd prime p, Fermat’s little theorem gives 2p − 1 ≡ 1 (mod p). Search for odd composite numbers that pass the same test.
Computed evidence
| Composite | Factorization | 2n − 1 mod n |
|---|
For every odd prime p, Fermat’s little theorem gives 2p − 1 ≡ 1 (mod p). Search for odd composite numbers that pass the same test.
| Composite | Factorization | 2n − 1 mod n |
|---|