# Math Help - Product of primes using induction

1. ## Product of primes using induction

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

2. 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 $k>1$, if it is a prime then proof complete. Otherwise, $k=ab$ where $a,b. But then by strong induction both $a,b$ can be written as a product of primes themselves. Thus, $k$ is a product of primes.