Re: [Tutor] Finding prime numbers

2007-09-20 Thread Nick Craig-Wood
Shawn Milochik <[EMAIL PROTECTED]> wrote: > Any improvements anyone? >>> import gmpy >>> for x in range(3,1000,2): ... if gmpy.is_prime(x): ... print x,"is prime" ... 3 is prime 5 is prime 7 is prime [...] >>> gmpy.is_prime(2**607-1) 1 >>> gmpy.is_prime(2**

Re: [Tutor] Finding prime numbers

2007-09-19 Thread Shawn Milochik
Okay, I caught one bug already myself: for y in range(3,(math.sqrt(x) + 1)): should be for y in range(3,(int(math.sqrt(x)) + 1)): -- http://mail.python.org/mailman/listinfo/python-list

Re: [Tutor] Finding prime numbers

2007-09-19 Thread Shawn Milochik
Here's my attempt: #!/usr/bin/env python import math for x in range(3,1000,2): isPrime = True for y in range(3,(math.sqrt(x) + 1)): if x % y == 0: isPrime = False break if isPrime: print "%d is prime." % x Notes: This doesn't bother with ev