Scribd
Upload
127 views

Euler's Function::: # S.T. Rel. Prime To

This document discusses the Euler phi function φ(n) which counts the number of positive integers less than n that are relatively prime to n. It provides the definitions and properties of φ(n), including that φ(n) is the number of elements in the set {k ∈ [0,n) | gcd(k,n) = 1}. Formulas are given for calculating φ(p) of a prime p, φ(pk) of a power of a prime pk, and φ(ab) of two relatively prime numbers a and b. Euler's theorem is also stated, that for any k relatively prime to n, kφ(n) is congruent to 1 modulo n.

Uploaded by

Dorel Barbu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
127 views

Euler's Function::: # S.T. Rel. Prime To

This document discusses the Euler phi function φ(n) which counts the number of positive integers less than n that are relatively prime to n. It provides the definitions and properties of φ(n), including that φ(n) is the number of elements in the set {k ∈ [0,n) | gcd(k,n) = 1}. Formulas are given for calculating φ(p) of a prime p, φ(pk) of a power of a prime pk, and φ(ab) of two relatively prime numbers a and b. Euler's theorem is also stated, that for any k relatively prime to n, kφ(n) is congruent to 1 modulo n.

Uploaded by

Dorel Barbu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Euler

Mathematics for Computer Science


MIT 6.042J/18.062J

Eulers Function

Albert R Meyer

Euler

March 9, 2012

(n) ::= # k0,1


[0,n)
,n-1
s.t. k rel. prime to n

lec 5F.1

function

function

Albert R Meyer

Euler

March 9, 2012

lec 5F.2

function

gcd1{n} ::=
{k [0,n) | gcd(k,n)=1}

(n) ::= # k [0,n)


s.t. gcd(k,n) = 1

so

(n) = |gcd1{n}|

(some books write


n* for gcd1{n})
Albert R Meyer

March 9, 2012

lec 5F.3

Albert R Meyer

March 9, 2012

lec 5F.4

Euler

function

Euler

function

gcd1{n} ::=
{k [0,n) | gcd(k,n)=1}

gcd1{n} ::=
{k [0,n) | gcd(k,n)=1}

gcd1{7} = {1,2,3,4,5,6}
gcd1{12} =

(7) = |{1,2,3,4,5,6}|
gcd1{12} =

{0,1,2,3,4,5,6,7,8,9,10,11}

{0,1,2,3,4,5,6,7,8,9,10,11}

Albert R Meyer

Euler

March 9, 2012

lec 5F.5

function

Euler

gcd1{n} ::=
{k [0,n) | gcd(k,n)=1}

(7) = 6
gcd1{12} =

March 9, 2012

March 9, 2012

lec 5F.6

function

gcd1{n} ::=
{k [0,n) | gcd(k,n)=1}

(7) = 6
(12) =

{0,1,2,3,4,5,6,7,8,9,10,11}
Albert R Meyer

Albert R Meyer

lec 5F.7

|{ 1,

5, 7,
Albert R Meyer

March 9, 2012

11}|
lec 5F.8

Euler

function

gcd1{n} ::=
{k [0,n) | gcd(k,n)=1}

(7) = 6
(12) = 4
Albert R Meyer

Calculating

March 9, 2012

lec 5F.9

If p prime, everything in
[1,p) is rel. prime to p, so

Albert R Meyer

March 9, 2012

lec 5F.10

Calculating (pk)
0,1,...,p,...,2p,.....,pk-p,...,pk-1

k rel. prime to 9 iff


k rel. prime to 3

p divides every pth number

3 divides every 3rd number

so, (9) = 9-(9/3) = 6


March 9, 2012

(p) = p 1

(9)? 0,1,2,3,4,5,6,7,8

Albert R Meyer

Calculating

lec 5F.11

pk/p of these numbers


are not rel. prime to pk
Albert R Meyer

March 9, 2012

lec 5F.12

Calculating

(pk)

Calculating

so

so

(pk) = pk pk/p
Albert R Meyer

Calculating

Lemma
:




For

(pk)

March 9, 2012

lec 5F.13

(ab)

(ab) = (a)(b)

Pset 5. Another
way later by counting.
pf:

March 9, 2012

Albert R Meyer

Calculating

a, b relatively prime,

Albert R Meyer

(pk) = pk pk-1

lec 5F.15

March 9, 2012

lec 5F.14

(ab)

(12) = (34)
= (3)(4)
= (3 - 1)(22 - 22-1)
= 2(4 - 2) = 4
Albert R Meyer

March 9, 2012

lec 5F.16

Eulers Theorem

For k relatively
prime to n,

k(n) 1 (mod n)
Albert R Meyer

March 9, 2012

lec 5F.17

You might also like