Re: Shortest prime number program

[swisscheese]

> [2]+[x for x in range(1,99) if 2**x%x==2]

42 - brilliant!
41:
[2]+[x for x in range(1,99)if 2**x%x==2]
... although it appears Christoph is right that it's not scalable.

-- 
http://mail.python.org/mailman/listinfo/python-list