Created
November 29, 2011 13:18
-
-
Save stevedoyle/1404781 to your computer and use it in GitHub Desktop.
A regex that test for prime numbers
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # From: http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/ | |
| def is_prime(n) | |
| ("1" * n) !~ /^1?$|^(11+?)\1+$/ | |
| end |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment