all,
>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. It's hard to
say, without any evidence, or solid math.
Just a side note, but all l_n values are 2 after n-1 iterations on a mersenne
prime. Maybe lends some small bit of evidence against that...
-Lucas
________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
