>Date: Sat, 18 Dec 1999 08:34:06 -0000
>From: "Brian J. Beesley"
>Subject: Re: Mersenne: v19 and priorities
>
>The valid range is 0-15.
>
>If you specify 0, you will lose half your CPU to the OS's native
>cycle sink. This is probably not what you want.
Which OS is this (some win32 obviously, but which)? In both windows 9x
and 2k, the idle thread has priority far below zero; I have never seen it
get any time slices while a priority zero (idle process, idle thread) task
was running.
>Date: Sat, 18 Dec 1999 22:34:10 -0500
>From: "Chris Nash"
>Subject: Re: Mersenne: Fibonacci Series
>
>>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.
That's certainly the 'obvious' way of trying to construct such starting
values. Can anyone think of any other ways to come up with them? It seems
'likely' that if there is no finite covering set of divisors there are an
infinite number of primes... but my intuition is more likely a negative
endorsement than a positive one ;-)
Colin Percival
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
