NUMBER THEORY- LECTURE 4

EULER’S THEOREM

March 23, 2024

1 Euler’s function

Euler’s φ-function is defined as follows: For m ≥ 1, ϕ(m) number of elements

from 1, 2, ..., m which are relatively prime to m.

Properties
1. If p is a prime , then, ϕ(p) = p − 1
2. If p is a prime , then, ϕ(pk ) = pk − pk−1
3. Let a and b be two relatively prime positive integers. Then ϕ(ab) =
ϕ(a)ϕ(b)
    
αk
4. If n = pα α2 1
1 · p2 ...pk , then , ϕ(n) = n 1 − p1
1
1 − p12 ... 1 − p1k

1
 5. ϕ(n) is even integer for n > 2
6. If a is coprime to m and a < m then, (m − a) is coprime to m .

2 Euler’s theorem

The Fermat–Euler Theorem is the generalization of Fermat’s theorem where

divisor need not be a prime number. It states that if gcd(a, m) = 1, then,

aϕ(m) ≡1(modm)

Problem set 1
1. Calculate ϕ(1001), ϕ(5040), ϕ(36000), ϕ(10n )
2. Find the number of unorded pairs (a, b) of co-prime natural numbers that
add up to 7200.

3. Find the sum of all numbers co-prime to 1000.

4. Find the reminder when 7200 + 11800 is divided by 101.
5. Find last two digits of 7200 − 3200

6. Find the remainder when 1992 is divided by 92

7. Find last two digits of 31234
8. Find Last three digits of 71997
9. Let an = 6n + 8n . Determine the remainder on dividing a83 by 49.

10. Show that 51|1032n+9 − 7.

11. Prove that 1001|p3600
1 + p3600
2 + ... + p3600
1001 where pi are distinct primes
greater than 13.
12. Show that if gcd(a, n) =gcd(a − 1, n) = 1, then, 1 + a + a2 + ... + aϕ(n)−1 ≡
0(mod n)
n
13. Prove that there are infinitely many positive integers n such that φ(n) = 3

Answers
1. ϕ(1001) = 720, ϕ(5040) = 1152, ϕ(36000) = 9600, ϕ(10n ) = 4 · 10n−1
2. 960

3. 200000
4. 02

2
5. 00
6. 49
7. 69
8. 207

9. 00