Prove that each prime divisor of 2p−1, where p is a prime, is greater

than p. (Notice that it follows from this problem that the number of primes

is infinite!)

Printable View

- Nov 30th 2007, 08:58 AManncareuler function and theorem
Prove that each prime divisor of 2p−1, where p is a prime, is greater

than p. (Notice that it follows from this problem that the number of primes

is infinite!) - Nov 30th 2007, 09:07 AMThePerfectHacker
- Nov 30th 2007, 12:59 PManncar
sorry. Its 2^p - 1. Thats 2 raised to the power 'p'