Hi folks
>U(1) = 1786772701928802632268715130455793
>U(2) = 1059683225053915111058165141686995
>U(N+2) = U(N+1) + U(N)
>I checked a few thousand terms, and they were all composite.
There is almost certainly a 'covering set' of divisors. In essence you need
to find a set of primes P and a modulus M, then prove that U(N) has a factor
in P specified by the value of N mod M.
Chris Nash
Lexington KY
UNITED STATES
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
