Message text written by "Brian J Beesley"
>> >I think we should check the math first. I have a sneaky suspicion that
looping
> >won't occur in the relevant region (the first 2^n-3 iterations) unless n
is
> >composite - which may be interesting, but doesn't help us eliminate
Mersenne
> >numbers as candidate primes. But my math is inadequate to prove this 8-(
>
> I think that you mean n-2 iterations, but you may be right.
Yup. Brain failure again. I think I must have been confused with the
idea that the sequnce _must_ recur within 2^n-3 iterations - there
are only 2^n-1 different values of the residual, and 2 of them are
special - see below
<
...I wonder if the LL sequence for a biggish MP would give a decent
pseudo-random series.
That is, I wonder if the series would be "better" than the usual
linear-congurential series (or sum of three).
Might win some support if there are still random number chasers out there.
Joth
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
