At 12:44 AM 6/17/03 +0000, Elias Daher wrote: >(quoting George) >>I'm also adding code to 23.5 to check EVERY iteration for an impossible >>result >>such as -2, -1, 0, 1, 2. This test will be very, very quick.
>But no matter how quick this additional test will be, it will slow down all >machines globally [...] >While if we consider that this additional test takes only 3 minutes per >exponent overall in average It will probably take less than 0.3 seconds per exponent overall because it will very seldom require checking any value other than the low order member. After each iteration check: if ( x(0) >= -2.0 AND x(0) <= 2.0 ) then // this code is rarely encountered and can be inefficient [check the rest of x(1:n-1)] end if --Luke _________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
