OmegaLearn.org Chapter 2.

Number Theory

Theorem 2.5.2
If a = x (mod n) and b ≡ y (mod n), then

ab ≡ xy (mod n)

Theorem 2.5.3
If a ≡ x (mod n), then
am ≡ x m (mod n)

Theorem 2.5.4 (Euler’s Totient Function)

If number n has the prime factorization

pe11 · pe22 · pe33 . . . penn

then

1 1 1
! ! !
φ(n) = n · 1 − 1− ... 1 −
p1 p2 pn

where φ(n) denotes the number of positive integers less than or equal to n that are
relatively prime to n.
Steps to find totient of a number

1. Find prime factorization

2. For all primes, calculate and multiply

1
1−
pi

3. Multiply this product to the number n to get the totient

Theorem 2.5.5 (Euler’s Totient Theorem)

aφ(n) ≡ 1 (mod n)
if and only if
gcd(a, n) = 1

40