Thursday Code Puzzler: Pandigital Primes
It's Thursday, so it's time for another code puzzler. The idea is simple: solve the coding problem as efficiently as you can, in any language or framework that you find suitable.
Note: Even though there really is nothing stopping you from finding a solution to this on the internet, try to keep honest, and come up with your own answer. It's all about the participation!
This weeks task is to find the largest pandigital prime. A number is pandigital if it uses all the digits from 1 to n exactly once. An example would be 123 with is a 3 digit pandigital number.
But here the task is to find the largest n-digits prime that exists.
Catch up on all our previous puzzlers here