for Let \ be the prime

prove that

Printable View

- Mar 1st 2010, 02:44 AMflower3prove,,,
for Let \ be the prime

prove that - Mar 1st 2010, 09:02 AMqmech
Suppose the next prime wasn't less or equal to your number (A= product of primes + 1). Is A prime? Clearly none of the primes less than A divide it (they all leave a remainder of 1). You have a contradiction.