Hi how can i show that if 2^(n-1) is prime then n is prime? thank you
Follow Math Help Forum on Facebook and Google+
Originally Posted by qwerty321 how can i show that if 2^(n-1) is prime then n is prime? HINT: is prime for only one value of .
erm 2^1 is the only power of 2 which is prime which mean n = 2...
Originally Posted by qwerty321 Hi how can i show that if 2^(n-1) is prime then n is prime? thank you I guess you meant , so that the question is less trivial... Let be a diviser of . Write . Apply the formula to to conclude that divides . Since is prime, this means or , hence ou . This proves that is prime.
View Tag Cloud