|
Project Euler Solutions
|
Functions | |
| def | main () |
Project Euler Problem 41 Once I found out where the end was, it seemed to be relatively easy Problem: We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also prime. What is the largest n-digit pandigital prime that exists?
| def python.p0041.main | ( | int | ) |
1.8.11