The Fermat test looks for a coprime base with . Such a witness proves compositeness by the Fermat little theorem, but Carmichael numbers pass for every coprime base.

Ancestors (5)

  1. Primality testing
  2. Computational complexity theory
  3. Theoretical computer science
  4. Computer science
  5. Home

Incoming links (3)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Fermat primality test by Wikipedia Bot 1
View more
The Fermat primality test is a probabilistic method used to determine whether a number is prime.
Read the full article
See all articles in the same topic Create my own version