On Thu, 26 Apr 2001 06:34:07 +0200 (MET DST), Hans Riesel wrote:
> Hi everybody,
>
> If 2^p-1 is known to be composite with no factor known, then so is
>2^(2^p-1)-1.
For that matter, the same argument can be made with regard to
2^(2^R-1)-2 for some RSA factoring challange number R, and probably
many other categories of numbers - even excluding the huge numbers of
genuine composites generated by GIMPS and other such projects.
It would be interesting to discuss whether numbers of this form can be
validly seen to have passed a compositness test...
Nathan
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
