On Sat, 11 Feb 2006 02:03:46 -0800, swisscheese wrote: > I figured someone out there must have written a minimal code size prime > number generator. I did not find one after a bit of searching around. > For primes up to 100 the best I could do was 70 characters (including > spaces): > > r=range(2,99) > m=[x*y for x in r for y in r] > [x for x in r if not x in m]
I swore I'd never play Python golf. p,r=[],range(2,99) while r:p,r=p+r[:1],[x for x in r if x%r[0]] And the result's in p. --Ian Bygrave -- http://mail.python.org/mailman/listinfo/python-list
