Workspace / Public example
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.

This example runs in your browser. Private notebooks use the research agent and its compute tools.