Determine if a number is a prime with regex?
- by kitlite
I found the following code example for Java on RosettaCode:
public static boolean prime(int n) {
return !new String(new char[n]).matches(".?|(..+?)\\1+");
}
I don't know Java in particular but understand all aspects of this snippet except for the regex itself
I have basic to basic-advanced knowledge of Regex as you find it in the built-in PHP…
