Abstract Algebra/Group Theory/Subgroup/Cyclic Subgroup/Euler's Totient Theorem

From testwiki
Revision as of 23:01, 12 September 2022 by imported>1234qwer1234qwer4 (cylic->cyclic - Fix a typo in one click)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Theorem

Let n be a positive integer. Let x be an integer relatively prime to n Let φ(n) = number of positive integers less than and relatively prime to n

xφ(n)1(modn)

Proof

/n× with multiplication mod n is a Group of positive integers less than and relatively prime to integer n.

φ(n) = o(/n×)

Let X be the cyclic subgroup of /n× generated by x mod n.

As X is subgroup of /n×

0. o(X) divides o(/n×)
1. o(/n×) / o(X) is an integer
2. xφ(n)=xo(/n×)=xo(X)o(/n×)/o(X)=[xo(X)]o(/n×)/o(X)=eo(/n×)/o(X)=e

Template:BookCat