prime numbers

[Paul Leyland]

On Sun, 2006-05-14 at 04:21, oreese at cfl.rr.com wrote:
> I think a number is prime when M=2
> for N = 3 to 11 step 2
> M = (2^N) mod N
> if M = 2 then print N
> next 

Try it for N = 11*31 = 341

Further, this topic has essentially nothing to do with GMP.


Paul

-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: This is a digitally signed message part
Url : http://gmplib.org/list-archives/gmp-discuss/attachments/20060514/92e8dd84/attachment.bin