using fermat's little theorem show that each prime divisor of (2^p) -1, where p is a prime is greater than p.
any help on this would be appreciated. thanks in advance!
*)In case you want to see the proof it is simple. We can write where by the division algorithm. That means but so but that is impossible since and is least so . Which means . And so clearly .