ABSTRACT
Exercise 206: (FTOA, Outline) Use the result from Exercise 297 and strong induction on n, and at the inductive step, argue by contradiction, that is, suppose that n has two different factorizations. There are other proofs of this result that don’t use induction; the standard one supposes that there are two different prime factorizations, then one argues that the primes must be the same (up to relabelling), and then one shows by contradiction that the exponents are the same.
