RosettaCodeData/Task/Primality-by-trial-division/Java/primality-by-trial-division-2.java

public static boolean prime(int n) {
    return !new String(new char[n]).matches(".?|(..+?)\\1+");
}