On Sat, 4 Jan 2003 05:08:16 +0100 [EMAIL PROTECTED] wrote: > 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.
5 mikus (and I know next to nothing about primes) _________________________________________________________________________ Unsubscribe & list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
