let m=2^(a*b)-1.
then 2^a-1 is a divisor of m.
example:
2^35-1=(2^5-1)*(2^30+2^25+2^20+2^15+2^10+2^5+1)
general:
2^(a*b)-1 = (2^a-1)*(2^((b-1)*a)+2^((b-2)*a)+...+2^(1*a)+1)
regards
Martin
-----Urspr�ngliche Nachricht-----
Von: Nathan Russell <[EMAIL PROTECTED]>
An: <[EMAIL PROTECTED]>
Gesendet: Samstag, 26. Februar 2000 06:33
Betreff: Mersenne: A couple quick questions
> I just joined GIMPS (now 6% done testing a number with exponent just
> short of 10M if it makes a difference) and I have been looking into the
> theory behind Mersenne primes.
> Can anyone show me or at least point me to a webpage with the proof
that
> the exponent of a Mersenne prime must be prime.
>============ snip ===================
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
