5 ms·
You would need a different proof (likely a much more complicated one) for n-ary primes.
by jwilk 5y ago
You would need a different proof (likely a much more complicated one) for n-ary primes.
- jwilk 5y agohttps://math.stackexchange.com/questions/1232463/how-to-prove-the-language-of-all-binary-numbers-that-are-prime-is-nonregular-usi https://math.stackexchange.com/questions/1232463/how-to-prov... has a proof for base 2. This method works for other bases too.
- kevinventullo 5y agoNice!