Thread: euler 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!)

Originally Posted by anncar

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!)

Not true, let p = 5 then 2p-1 = 9 but the divisors of 9 are not greater than 5.

sorry. Its 2^p - 1. Thats 2 raised to the power 'p'