A Mersenne number M_p = 2^p - 1, where p is prime and p < 1000, has a prime divisor q with q == 1 (mod 2002) and q == -1 (mod 2001) [== denotes congruent]. Find q mod 2003.
Peter Montgomery
_________________________________________________________________________
Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
