At 11:48 AM 1/24/00 +0100, Paul Landon wrote:
> On the average, the largest prime factor of n is n^0.6065,
>
>But for Mersennes this might not be the case.
>For the size of exponents that we deal with Mersennes are less
>composite than a random set of ones & zeroes.
That's right, but the original question just said a large random number.
+--------------------------------------------------------+
| Jud McCranie |
| |
| 137*2^197783+1 is prime! (59,541 digits, 11/11/99) |
| 137*2^224879+1 is prime! (67,687 digits, 1/00) |
+--------------------------------------------------------+
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
