Function to match Prime numbers Java/JavaScript/Python

regex-match-prime-numbers.md

TypeScript

// Using ECMAScript 6 repeat function
const isPrime = (n: number): boolean => {
    let re = /^.?$|^(..+?)\1+$/;
    return !re.test('1'.repeat(n));
}

JavaScript

// Using ECMAScript 6 repeat function
const isPrime = (n) => {
    let re = /^.?$|^(..+?)\1+$/;
    return !re.test('1'.repeat(n));
}

const isPrime = (n) => {
    let re = /^.?$|^(..+?)\1+$/;
    return !re.test(Array(n + 1).join('1'));
}

Java

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

Python

import re

def is_prime(n):
    return not re.match(r'^.?$|^(..+?)\1+$', '1' * n)

Credits

https://iluxonchik.github.io/regular-expression-check-if-number-is-prime/