Prime Numbers
Prime, Composite
A natural number
Coprime
Two integers
Prime Factorization (PF)
Every natural number can be written as a product of primes
That is, for all natural numbers
Actually, the existence of these factors is unique when disregarding order, as stated in the unique factorization theorem
We prove this by strong induction on
The natural number
can be written as a product of primes
Base Case: The statement
Inductive Step: Let
Assume the inductive hypothesis, $P(2) \land
That is, we assume that the natural number
We wish to prove
The integers
Case 1: If
Case 2: If
Therefore, by the inductive hypothesis,
The result is true for
Euclid's Theorem (ET)
The number of primes is infinite
Assume, for the sake of contradiction, that the number of primes is finite, say
Let primes be denoted by
Since
Now,
From the division algorithm, this means that we have remainder
But it is implied that
This is a contradiction, since by the proposition of Prime Factorization,
As a result, the statement is true.