Let 2k + 1 be a prime number. Prove that then k= 0 or k= 2n for some n
2> 0.
Answers
Answer:
its so simple n multiplied by k = n is 0 + n
Step-by-step explanation:
Answer:
- The given number is + 1 , which is a prime number.
- we have to prove :
- k= 0 ; or
- k= for some > 0.
- Case 1 : for k=0;
Putting k=0 in the given number + 1 , we get
+ 1 = + 1 = 1+1 = 2 , which is a prime number.
- Case 2 : Assume k is not a power of 2, i.e. k≠
let k=m. [ where m is an odd prime factor]
note:
For any odd number m , + 1 = (x + 1)(1 - x + - + - ..........+)
Hence : + 1 has one factor (x + 1).
Side Proof :
Consider the g.p. (1 - x + - + - ..........+) with a= 1, r = -x upto m terms.
so, (1 - x + - + - ..........+) = (1 - x + - + - ..........+ ) = = ;
If m is odd , then = -1 and = 1
For m is odd, (1 - x + - + - ..........+ =
For m is even , (1 - x + - + - ..........+ =
+ 1 = (x + 1)(1 - x + - + - ..........+) , as required
If , k=m. , then + 1 = + 1
+ 1 has a factor + 1
So, we can say , if k is not a power of 2, then + 1 is not a prime.
Hence, it is proved that + 1 be a prime number if k= 0 or k= for some > 0.