Professional Documents
Culture Documents
THEORETIC
FUNCTIONS
PRIME FACTORIZATION
Find the prime factorization of
the following integers.
1. 27 6.243
2. 72 7. 125
3. 54 8. 180
4. 36 9. 144
5. 96 10. 243
Definition:
A number theoretic function
is a special function whose
domain covers on the set of
positive integers.
𝜏 (𝑛) – symbol for the number of
positive divisors of n
An integer n is called
a perfect number
if σ(n) = 2n.
ABUNDANT NUMBER
An integer n is called
an abundant number
or excessive number
if σ(n) > 2n.
DEFICIENT NUMBER
An integer n is called
a deficient number
if σ(n) < 2n.
Definition:
Let n be a positive integer.
The Euler phi-function ϕ (n) is
defined to be the number of
positive integers not
exceeding n which are
relatively prime to n.
GROUP I
1.5
2.7
3.11
4.23
5.43
GROUP II
1.9
2.16
3.25
4. 32
5.49
GROUP III
1.6
2.15
3.24
4. 96
5.108
Case 1: p is prime
ϕ (p) = p-1
ϕ(n) = (p1α1-1)(p1-1)•(p2α2-1)(p2-1)•••
(pkαk-1)(pk-1)
ϕ(n) = (p1α1-p1α1-1)•(p2α2-p2α2-1)•••
(pkαk-pkαk-1)
ϕ(n) = p1α1(1-1/p1)p2α2(1-1/p2)•••
pkαk(1-1/pk)
ϕ(n) = p1α1(1-1/p1)p2α2(1-1/p2)•••
pkαk(1-1/pk)
ϕ(n) = p1α1 • p2α2 • pkαk • (1-1/p1) •
(1-1/p2)•(1-1/pk)
ϕ(n) = n • (1-1/p1) • (1-1/p2)•(1-1/pk)
PROBLEM SET
Evaluate:
1. ϕ(48) 6. ϕ(147)
2. ϕ(56) 7. ϕ(152)
3. ϕ(85) 8. ϕ(200)
4. ϕ(92) 9. ϕ(324)
5. ϕ(102) 10. ϕ(16,000)