Mersenne prime


by Bleys
Tags: mersenne, prime
Bleys
Bleys is offline
#1
Oct22-09, 07:00 AM
P: 74
I was trying to prove the statement "If (2^n)-1 is prime then n is prime". I've already seen the proof using factorisation of the difference of integers and getting a contradiction, but I was trying to use groups instead. I was wondering if it's possible, since I keep getting stuck.
So far I've got:
If (2^n)-1=p where p is prime then [tex]2^{n}\equiv1 mod(p)[/tex]. The group {1,2,...,p-1} is cyclic and every element has order p-1. So n = k(p-1) for some positive integer k. But doesn't this mean n is not prime? which is wrong I know. Could someone point me in the right direction or a theorem that might be useful?
Phys.Org News Partner Science news on Phys.org
SensaBubble: It's a bubble, but not as we know it (w/ video)
The hemihelix: Scientists discover a new shape using rubber bands (w/ video)
Microbes provide insights into evolution of human language
fantispug
fantispug is offline
#2
Oct23-09, 11:56 PM
P: 105
Interesting problem... I'm not yet sure of a proof, but your statement

Quote Quote by Bleys View Post
The group {1,2,...,p-1} is cyclic and every element has order p-1.
is wrong. All you know is that every element has an order that divides p-1. (E.g. for p=7 the element 2 has order 3).


Register to reply

Related Discussions
Order of 3 modulo a Mersenne prime Linear & Abstract Algebra 4
TWO new Mersenne primes? Linear & Abstract Algebra 3
New Mersenne numbers conjecture Linear & Abstract Algebra 4
M43: GIMPS project has found a new Mersenne prime Linear & Abstract Algebra 15
The GIMPS project has found a new Mersenne prime number: M42. Linear & Abstract Algebra 4