Scribd
Upload
150 views

Euler's Totient Function and Euler's Theorem: n φ (n) numbers coprime to n

The Euler's totient function φ(n) counts the numbers less than n that are relatively prime to n. It has important properties related to prime numbers and modular arithmetic. For prime numbers p, φ(p) = p-1. For composite numbers n with prime factorization ∏piai, φ(n) = n(1 - 1/pi)⋯(1 - 1/pj). Euler's theorem states that if a and n are coprime, then aφ(n) ≡ 1 (mod n), generalizing Fermat's little theorem to composite moduli.

Uploaded by

safsdf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
150 views

Euler's Totient Function and Euler's Theorem: n φ (n) numbers coprime to n

The Euler's totient function φ(n) counts the numbers less than n that are relatively prime to n. It has important properties related to prime numbers and modular arithmetic. For prime numbers p, φ(p) = p-1. For composite numbers n with prime factorization ∏piai, φ(n) = n(1 - 1/pi)⋯(1 - 1/pj). Euler's theorem states that if a and n are coprime, then aφ(n) ≡ 1 (mod n), generalizing Fermat's little theorem to composite moduli.

Uploaded by

safsdf
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Euler's Totient Function and Euler's Theorem

The Euler's totient function, or phi () function is a very


important number theoretic function having a deep
relationship to prime numbers and the so-called order of
integers. The totient (n) of a positive integer n greater
than 1 is defined to be the number of positive integers less
than n that are coprime to n. (1) is defined to be 1. The
following table shows the function values for the first
several natural numbers:
n

(n)

numbers coprime to n

1, 2

1,3

1,2,3,4

1,5

1,2,3,4,5,6

1,3,5,7

1,2,4,5,7,8

10

1,3,7,9

11

10

1,2,3,4,5,6,7,8,9,10

(n)

numbers coprime to n

12

1,5,7,11

13

12

1,2,3,4,5,6,7,8,9,10,11,12

14

1,3,5,9,11,13

15

1,2,4,7,8,11,13,14

Can you find some relationships between n and (n)? One thing you may have
noticed is that:

when n is a prime number (e.g. 2, 3, 5, 7, 11, 13), (n) = n-1.


But how about the composite numbers? You may also have
noticed that, for example, 15 = 3*5 and (15) = (3)*(5) = 2*4
= 8. This is also true for 14,12,10 and 6. However, it does not
hold for 4, 8, 9. For example, 9 = 3*3 , but (9) = 6 (3)*(3)
= 2*2 =4. In fact, this multiplicative relationship is conditional:
when m and n are coprime, (m*n) = (m)*(n).
The general formula to compute (n) is the following:
If the prime factorisation of n is given by n =p1e1*...*pnen, then
(n) = n *(1 - 1/p1)* ... (1 - 1/pn).
For example:
9 = 32, (9) = 9* (1-1/3) = 6
4 =22, (4) = 4* (1-1/2) = 2
15 = 3*5, (15) = 15* (1-1/3)*(1-1/5) = 15*(2/3)*(4/5) =8
Eulers theorem generalises Fermats theorem to the case where the modulus is not
prime. It says that:
if n is a positive integer and a, n are coprime, then a(n) 1 mod n where (n) is the
Euler's totient function.

Let's see some examples:


165 = 15*11, (165) = (15)*(11) = 80. 880 1 mod 165
1716 = 11*12*13, (1716) = (11)*(12)*(13) = 480. 7480 1 mod 1716
(13) = 12, 912 1 mod 13

You might also like