Problem Attribution - This challenge was inspired by Problem 41 on Project Euler
👋 Welcome Gophers! In this challenge, you are tasked with implementing the
LargestPandigitalPrime function which will return the largest possible pandigital prime number.
An n-digit number is pandigital if it makes use of all the digits
1 to n exactly ones.
pandigital := LargestPandigitalPrime() // returns largest pandigital prime
See the Solution
Feel free to have a look at the forum discussion thread for this challenge and contribute with your own solutions here - Challenge 22 - Pandigital Primes
If you enjoyed this challenge, you may also like some of the other challenges on the site!