Math 2.0

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.

What this node 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 node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Fermat_pseudoprime, lead section