Re: Mersenne: M(M(127)) and other M(M(p))

[Chris Nash]

> even bigger prime.  If for example, 6*M(p)+1 divides M(M(p)), then it must
> be prime!

Before anybody gets overexcited at the last posting...

It is TRUE that if 2k.M(p)+1 divides M(M(p)), M(p) is prime, and k<2M(p)+2,
then 2k.M(p)+1 is prime.

However, unless I'm mistaken, non-divisibility does not prove compositeness.
You could walk past a prime (in fact, you'd expect to walk past several) and
you'd never know...

Chris


_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ      -- http://www.tasam.com/~lrwiman/FAQ-mers