Proof of Conjecture: n Not Prime => 2^n-1 Not Prime

chimath35
Messages
110
Reaction score
0
Conjecture: suppose n is an integer larger than 1 and n is not prime. Then 2^n-1 is not prime.

Proof attached.

Could someone please explain to me how they got to xy= 2^(ab)-1. I see the -1 part. Also I think I

do not understand the concept of 2^((a-1)b) I mean is it some index or some way of showing it is

finite? I am confused.
 
Physics news on Phys.org
The picture of the proof is showing up right?
 
I do not see any picture of the proof attached viewing this on the mobile app on my iPad or when I go to web view.
 
chimath35 said:
Conjecture: suppose n is an integer larger than 1 and n is not prime. Then 2^n-1 is not prime.

Proof attached.

Could someone please explain to me how they got to xy= 2^(ab)-1. I see the -1 part. Also I think I

do not understand the concept of 2^((a-1)b) I mean is it some index or some way of showing it is

finite? I am confused.

There is no attachment.

Please start a new thread using the homework template, and showing what you have done. I am closing this thread.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top