I've done some Codewars problems where you have to write a regex to check whether an input number is divisible by a specific number, so I was really interested

I've done some Codewars problems where you have to write a regex to check whether an input number is divisible by a specific number, so I was really interested to see how that would work for primes. Nope, it's just playing with lengths.