Shortest prime number program

swisscheese jimlewis at miclog.com
Sat Feb 11 08:25:41 EST 2006

Previous message (by thread): Shortest prime number program
Next message (by thread): Shortest prime number program
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

>You can save two bytes with

56 - nice catch.
55:
r=range(2,99)
[x for x in r if sum(x%d<1 for d in r)<2]

Previous message (by thread): Shortest prime number program
Next message (by thread): Shortest prime number program
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

More information about the Python-list mailing list