Created
April 15, 2012 12:46
-
-
Save ryenus/2392592 to your computer and use it in GitHub Desktop.
A regular expression to check for prime numbers
This file contains hidden or 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
| # see http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/ | |
| /^1?$|^(11+?)\1+$/ |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment