... . He claims the proof is "remarkably simple". Let p be a prime and q=1 x 2 x 3 x x p+1; That is, one more than the product of all the integers from 1 through p. The integer q is larger than p and is not divisible by any integer from 2 through p, inclusive. Any one of its positive divisors, other than 1, and any one of its prime divisors, therefore, must be larger than p. It follows that ... ...

• Word Count: 533
• Approx Pages: 2
• Grade Level: High School