Answer to Question #1238 in Combinatorics | Number Theory for Sagar

Question #1238

How can I prove that p=(2^k)-1 is prime if k is odd integer except when k=2?

Expert's answer

If k = 2
p = 2^2 -1 = 3 is prime too.
Maybe you should assume k as prime and use for proving the following equation
(x^k) - 1 = (x - 1)*(x^(k-1) + x^(k-2) + ... + x + 1)

Learn more about our help with Assignments: Math

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. What is the sum of square of 2,3,5 and 7? Grade 5.
2. My question is write the number that is one hundred million more than 15,146,481
3. Let 1210AB be a six-digit number with two digits (A and B) being unknown. Assume that the number sh
4. What is the sense of the equations: ABC = A; A ∪ B ∪ C = A?
5. Is it possible to set 10 bus routes in the city and set the stations on them so that if we take any
6. Is it possible to divide 2n persons into pairs in 2n-1 different ways so that each person was paired