Lecture quiz 3

Based on Theorem 0 and Lemma 1.1.4. prove that any composite number n<120 must have
a factor of 2 or 3 or 5 or 7.

Theorem 0: if n=km, then k ≤ √ n ≤m .

Lemma 1.1.4.: Every natural number greater than 1 has a prime divisor.

Proof:

Assume that we can construct every natural number n smaller than 120 using n=km, where
k and m are also natural numbers.
By Lemma 1.1.4, it is deduced that every natural number greater than 1 and smaller than
120 has a prime divisor.
By Theorem 0, one of the factors of n, k, may be at most 10.
Within 10 there are four prime numbers (2, 3, 5 and 7).
All remaining numbers within 10 (4, 6, 8, 9 and 10) are composite so they must also have a
prime divisor which must be less than 10 (2 and 3).
Therefore, by Lemma 1.1.4 all other numbers greater than 10 that are composite must have
a prime factor of less than 10, which can only be 2, 3, 5 and 7.
Proof is completed.