(The fundamental theorem of arithmetic). Use strong induction to show that every natural number greater than 1 can be written as a product of primes. Hint. Use the inductive hypothesis that every number n satisfying 2 ≤ n ≤ m can be written as a product of primes n = p1p2 · · · pr for some positive integer r.