PlanetMath: Euler-Fermat theorem

(more info)

Math for the people, by the people.

Main Menu

sections Encyclopædia
Papers
Books
Expositions

meta Requests (200)
Orphanage
Unclass'd
Unproven (490)
Corrections (6)
Classification

talkback Polls
Forums
Feedback
Bug Reports

downloads Snapshots
PM Book

information News
Docs
Wiki
ChangeLog
TODO List
Legalese
About

Entry average rating: No information on entry rating

Euler-Fermat theorem

(Theorem)

If $a,n \in \mathbb{Z}$ such that $\gcd(a,n)=1$ , then $a^{\varphi (n)} \equiv 1 \operatorname{mod} n$ , where $\varphi$ is the Euler totient function.

"Euler-Fermat theorem" is owned by Wkbj79. [ full author list (2) | owner history (1) ]

(view preamble)

Other names:

Euler's theorem

Keywords:

number theory

Attachments:: proof of Euler-Fermat theorem (Proof) by KimJ
corollary of Euler-Fermat theorem (Result) by kamala
proof of Euler-Fermat theorem using Lagrange's theorem (Proof) by alozano

Log in to rate this entry.
(view current ratings)

Cross-references: Euler totient function
There are 6 references to this entry.

This is version 6 of Euler-Fermat theorem, born on 2001-10-15, modified 2007-08-23.
Object id is 198, canonical name is EulerFermatTheorem.
Accessed 11859 times total.

Classification:

AMS MSC:	11-00 (Number theory :: General reference works )
	20-01 (Group theory and generalizations :: Instructional exposition )
	20A05 (Group theory and generalizations :: Foundations :: Axiomatics and elementary properties)

Pending Errata and Addenda

None.[ View all 2 ]

Discussion

forum policy

Interact