Scribd
Upload
131 views4 pages

Cabudol, Angel B. Bsed Ii - Math: Rules in Solving Euler Phi Function or Totient Function

1) Euler's theorem states that if two numbers a and n are relatively prime, then a^φ(n) ≡ 1 (mod n), where φ(n) is Euler's totient function. 2) Euler's totient function φ(n) counts the number of positive integers less than n that are relatively prime to n. 3) Euler's theorem can be used to reduce large powers modulo n, which is useful for calculations.

Uploaded by

Cabudol Angel Baldiviso
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
131 views4 pages

Cabudol, Angel B. Bsed Ii - Math: Rules in Solving Euler Phi Function or Totient Function

1) Euler's theorem states that if two numbers a and n are relatively prime, then a^φ(n) ≡ 1 (mod n), where φ(n) is Euler's totient function. 2) Euler's totient function φ(n) counts the number of positive integers less than n that are relatively prime to n. 3) Euler's theorem can be used to reduce large powers modulo n, which is useful for calculations.

Uploaded by

Cabudol Angel Baldiviso
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/ 4

CABUDOL, ANGEL B.

BSED II - MATH

EULER’S THEOREM

In number theory, Euler's Theorem (also known as the Fermat–Euler theorem)


requires the use of Euler phi function or totient function and denoted by φ(n).
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) is defined for the positive integer n, as the number of positive integers
less than n that are relatively prime or coprime to n {φ (1) is arbitrarily defined as 1}. The
Euler Totient Function at n is how many of these relatively prime or coprime numbers
there are less than n.

Rules in Solving Euler Phi Function or Totient Function


Rule #1. If n is a prime then, φ(n) = n – 1.
n = 13
φ(13) = 13 – 1 = 12
Consequently, there are 12 numbers relatively prime or coprime of φ(13).

Rule #2. If a = pn is a prime power then, φ(pn) = pn – pn – 1.


n = 32
φ(32) = 25 so φ(32) = 25 – 24 = 16

Rule #3. If gcd  (m, n)  = 1 then, φ(m*n) = φ(m)*φ(n).


n = 15.
15 = 3*5
φ(15) = φ(3*5) = φ(3)*φ(5) = (3 – 1)(5 – 1) = 2*4= 8.

The general formula to compute φ(n) is the following: If the prime factorization of n is
given by n = p1e1*...*pnen, then,
φ(n) = n *(1 - 1/p1)* ... (1 - 1/pn).
Example:
CABUDOL, ANGEL B.
BSED II - MATH

9 = 3², φ(9) = 9* (1 – 1/3) = 6


15 = 3*5, φ(15) = 15* (1 – 1/3)*(1 – 1/5) = 15*(2/3)*(4/5) = 8

Another way of solving Euler Totient Function


Example: n = 15
Step1. List all positive fractions less than 1 with 15 as a denominator.
1/15, 2/15, 3/15, 4/15, 5/15, 6/15, 7/15, 8/15, 9/15, 10/15, 11/15, 12/15,
13/15, 14/15
Step2. Now reduce all fractions down to simplest form.
1/15, 2/15, 1/5, 4/15, 1/5, 2/5, 7/15, 8/15, 3/5, 2/3, 11/15, 4/5, 13/15, 14/15
Step3. Eliminate all the ones that got reduced shared some divisor with 15.

The remaining ones that still have 15 as a denominator shared no common


divisors (except 1 of course) with 15 are the numbers we called "relatively prime or
coprime with 15" because they share no common prime factors with 15. So, there are 8
numbers relatively prime or coprime of φ(15).

Euler’s Theorem.
Euler’s theorem generalizes Fermat’s theorem to the case where the modulus is
not prime. This theorem states that if two numbers a and n are relatively prime (if they
share no common factors apart from 1) then,
aφ(n) ≡ 1 (mod n),
where φ(n) is Euler's totient function, which is being discussed above.
For instance, putting n = 30 and a = 11, we have
11φ(30) ≡ 118 ≡ (11²)⁴ ≡ (121)⁴ ≡ 1⁴ ≡ 1 (mod 30)

Let’s have an another example:


1. Show by calculation that Euler's theorem is true for n = 10 and a < n.
Solution:
a = 1,3,7,9 and φ(10) = 4
So a⁴ ≡ 1 (mod 10).
CABUDOL, ANGEL B.
BSED II - MATH

Then we have,
1⁴ ≡ 1 (mod 10)
3⁴ ≡ 84 ≡ 1 (mod 10)
7⁴ ≡ 2401 ≡ 1 (mod 10)
9⁴ ≡ 6561 ≡ 1 (mod 10)
2. Using Euler's theorem calculate 7133 modulo 26.
Solution:
φ(26) = (2 – 1) (13 – 1) = 12
So 712 = 1 (mod 26)
Thus,
7133 ≡ 7¹³² × 7¹
≡ (7¹²)¹¹ × 7
≡ 1¹¹ × 7
≡1×7
≡ 7 (mod 26)
3. Let p and q be distinct primes.
Let a be any positive integer less than both p and q.
Let k be any positive integer.

Prove that:
ak(p – 1)(q – 1)+1 ≡ a (mod pq)

Since a < p and a < p it follows that gcd(a, pq) = 1.


So we can use Euler's theorem.
Thus, aφ(pq) ≡ 1 (mod pq)

Raising both sides to the power k we have


(aφ(pq))k ≡ 1k (mod pq)
Thus
akφ(pq) ≡ 1 (mod pq)
From which
CABUDOL, ANGEL B.
BSED II - MATH

akφ(pq) × a ≡ a (mod pq)


Hence
akφ(pq)+1 ≡ a (mod pq)
Which implies that
ak(p – 1)(q – 1)+1 ≡ a (mod pq)

Euler's theorem is helpful in reducing large powers modulo n. To site a typical


example, let us fine the last two digits in the decimal representation of 3 256 ; this is
equivalent to obtaining the smallest nonnegative integer to which 3 256 is congruent
modulo 100. Since gcd (3, 100) = 1 and
Φ (100) = Φ (2²*5²) = 100 (1 – 1/2)(1 – 1/5) = 40,
Euler's Theorem yields
3⁴0 ≡ 1 ( mod 100).
By the Division Algorithm, 256 = 6*40 + 16; whence
3256 ≡ 36*40+16 ≡ (340)6*316 ≡ 316 (mod 100)
And our problem reduces to one of evaluating 316, modulo 100.
The calculations are as follows, with reasons omitted:
316 ≡ (3⁴)⁴ ≡ (81)⁴ ≡ (-19)⁴ ≡ (-19²)²≡ (361)² ≡ 61² ≡ 3721 ≡ 21 (mod 100).

End!!!

You might also like