Skip to content

Created problem_41 in project_euler #2334

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 5 commits into from
Aug 19, 2020
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions project_euler/problem_41/__init__.py
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
#
53 changes: 53 additions & 0 deletions project_euler/problem_41/sol1.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,53 @@
from math import sqrt
from typing import List
from itertools import permutations

"""
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?
"""

"""
All pandigital numbers except for 1, 4 ,7 pandigital numbers are divisible by 3.
So we will check only 7 digit panddigital numbers to obtain the largest possible
pandigital prime.
"""


def is_prime(n: int) -> bool:
"""
Returns True if n is prime,
False otherwise.
>>> is_prime(67483)
False
>>> is_prime(563)
True
>>> is_prime(87)
False
"""
if n % 2 == 0:
return False
for i in range(3, int(sqrt(n) + 1), 2):
if n % i == 0:
return False
return True


def compute_pandigital_primes(n: int) -> List[int]:
"""
Returns a list of all n-digit pandigital primes.
>>> compute_pandigital_primes(2)
[]
>>> max(compute_pandigital_primes(4))
4231
>>> max(compute_pandigital_primes(7))
7652413
"""
pandigital_str = "".join(str(i) for i in range(1, n + 1))
perm_list = [int("".join(i)) for i in permutations(pandigital_str, n)]
return [num for num in perm_list if is_prime(num)]


if __name__ == "__main__":
print(f"{max(compute_pandigital_primes(7)) = }")