Fundamental Theorem of Arithmetic

1. Fundamental Theorem of Arithmetic. Every positive integer can be writ-

ten uniquely as a product of a set of primes, with prime factors. Factorization
of integers in which factors are combined to form powers are called prime-power
factorizations.
2. Lemma. If a, b, and c are positive integers such that (a, b) = 1 and a|bc, then
a|c.
3. Corollary. Let b, c ∈ Z+ . If prime p divides bc, then either p|b or p|c. Exten-
sion: Let a1 , a2 , . . . , an ∈ Z+ . If prime p divides a1 a2 · · · an , then p divides ai
for some i.
4. Proof of the Fundamental Theorem:
Proof of existence: Suppose, by contradiction, that there is a positive integer
that is not a product of primes, and let n be the smallest such integer.
If n is prime, then it is obviously a product of a set of primes: (1) .
If n is composite, it must have factors a and b where (2) . Since
n is the smallest positive integer that is not a product of primes, then
(3) . But since n = ab, then (4) .
Proof of uniqueness: Suppose there exists a positive integer that has two
prime factorizations, and let n be the smallest such integer. Then
n = p1 p2 · · · ps and n = q1 q2 · · · qt ,
where each pi and qi are all primes, and p1 ≤ p2 ≤ · · · ≤ ps and q1 ≤ q2 ≤ · · · qt .
Suppose that p1 < q1 . Then (5) . This means that
(6) , so (7) , a contradiction. A
similar contradiction occurs if we assume (8) . Thus, (9) .
Since p1 = q1 , then (10) . But this integer is smaller
than n. Therefore, (11) . Thus, (12)

Problems

1. Consider M = 33 × 52 × 7. Is M divisible by 2? 3? 5? 6? 7? 9? 81? 63? 15?

2. If M = 34 × 53 × 76 × 198 . Is M + 5 divisible by 10?
3. The number 49,725 represents the ages of a group of teenagers multiplied to-
gether. How many teenagers are there, and what are their ages?
4. How many factors does 24 = 16 have? What about 27 ? Give a generalization.
 5. How many factors does 23 32 = 72 have? What about 24 35 ? Give a generaliza-
tion.
6. If N is factored into primes, say N = pn1 1 pn2 2 · . . . · pnk k , then how many factors
does N have?
7. Which positive integers have exactly three positive divisors? four positive di-
visors? thirteen positive divisors?
8. Suppose x and y are both integers. Find a solution to (2x + y)(5x + 3y) = 7.
9. Suppose 3x−1 5y+2 = 7z 11t , where the exponents are nonnegative integers. Find
a solution and explain why the solution is unique.
10. How many distinct ordered pairs (x, y), where x and y are positive integers,
are there that make x4 y 4 − 10x2 y 2 + 9 = 0? Explain.
11. What is the largest prime factor of 29! + 30!. Explain. [Hint: Factor out 29!]
12. Find a number n such that n + 2, n + 3, . . . , n + 2015 are all composite.
13. Prove that all the powers in the prime-power factorization of an integer n are
even if and only if n is a perfect square.
14. Prove that if p is prime and a is a positive integer with p|a2 , then p|a.
15. Two of the following statements are true, and the other is false. Prove the true
statements and give a counterexample for the false statement.
(a) If a and b are positive integers and a2 |b3 , then a|b.
(b) If a and b are positive integers and a2 |b2 , then a|b.
(c) If a and b are positive integers and a3 |b2 , then a|b.
16. Let p be a prime and n a positive integer. If pa |n, but pa+1 - n, we say that
pa exactly divides n, and we write pa ||n. Prove that if pa ||m and pb ||n, then
pa+b ||mn.
17. Give the prime-power factorization of 20!.