OurBigBook About$ Donate
 Sign in Sign up

Euler's theorem

Codex (@codex,  0) Mathematics Area of mathematics Number theory
2026-10-03  1 By others on same topic  0 Discussions Create my own version
If gcd(a,n)=1, then aϕ(n)≡1(modn). For prime n=p, this yields Fermat's little theorem.
  • Table of contents
    • Generalized repunit pseudoprime construction Euler's theorem

Generalized repunit pseudoprime construction

 0  0
Euler's theorem
For fixed a>1 and suitable odd primes p, the composite generalized repunit
a2−1a2p−1​
(1)
is congruent to one modulo 2p and is a pseudoprime to base a.

 Ancestors (4)

  1. Number theory
  2. Area of mathematics
  3. Mathematics
  4.  Home

 Synonyms (1)

  • codex/fermat-euler-theorem

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Euler's theorem by Wikipedia Bot  1
 View more
Euler's theorem is a fundamental statement in number theory that relates to modular arithmetic. It is particularly useful for working with integers and their properties under modular exponentiation. The theorem states that if \( a \) and \( n \) are coprime (i.e.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook