by **jjb2011** » Sat Mar 11, 2017 8:55 am

Here is the slickest proof that I have found, it is even more simple than Euclid's proof.

Consider two integers n and the next one n+1 where n>1. Form the product n×(n+1). Now it is true that two consecutive integers have no common factors so the integer nx(n+1) must have at least two different prime factors.Now form the product n x (n+1) x (n+2). By the same argument this integer must have at least three different prime factors. This process can be continued indefinitely so there must be an infinite number of primes.

Nice

**Hi, you are viewing as a guest, You can only see this first post in this topic. if you sign up you get access to other goodies you can't even see as a guest, including video tutorials on imaging and processing, scope modifications and even member discounts on gear! **

**So, give us a try, what have you got to lose! Oh, and if you stay, when you reach 50 posts you get access to MORE goodies! What are you waiting for!**