Math 2.0

Number theory Concept

Fermat pseudoprime

Summary

A Fermat pseudoprime to a base aa is a composite number nn that satisfies the congruence an−1≡1(modn)a^{n-1} \equiv 1 \pmod n of Fermat's little theorem. The definition of a Fermat pseudoprime gives the precise form.

Further reading

  1. Web https://en.wikipedia.org/wiki/Fermat_pseudoprime, lead section
About this page
Tag0W93FJAC8F
URIm2://0W93FJAC8F
Kindconcept
WritingW0 stub
MSC11A51
SpecializesComposite number
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions

Special cases