Thread: Product of primes using induction

prove by using induction that every integer k, k>1, can be written as a product of primes,

Originally Posted by Sally_Math

prove by using induction that every integer k, k>1, can be written as a product of primes,

Use strong induction. Say , if it is a prime then proof complete. Otherwise, where . But then by strong induction both can be written as a product of primes themselves. Thus, is a product of primes.