Fermat-Euler_theorem

introduction

%%visits: 5 ## intuition Fermat-Euler_theore := Let a ∈ ℤ and m be a positive integer. Suppose gcd(a, m) = 1. Then a^ϕ(m) ≡ 1 mod m

Taking m=p we get Fermats_little_theorem

Proof. Order of an element divides the order of a group. Lagranges_theorem

notation for order is the $o( ) $ notation. ## rigour ## exam clinic ## examples and non-examples ## resources tags :math:

backlinks

• index_of_files.pd