RosettaCodeData/Task/Primality-by-trial-division/Python/primality-by-trial-division-4.py
Ingy döt Net b83f433714 tasks a-s
2013-04-10 23:57:08 -07:00

7 lines
194 B
Python

>>> import re
>>> def isprime(n):
return not re.match(r'^1?$|^(11+?)\1+$', '1' * n)
>>> # A quick test
>>> [i for i in range(40) if isprime(i)]
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]