-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem 43
More file actions
40 lines (31 loc) · 1.08 KB
/
Copy pathproblem 43
File metadata and controls
40 lines (31 loc) · 1.08 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
"""
The number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-string divisibility property.
Let d1 be the 1st digit, d2 be the 2nd digit, and so on. In this way, we note the following:
d2d3d4=406 is divisible by 2
d3d4d5=063 is divisible by 3
d4d5d6=635 is divisible by 5
d5d6d7=357 is divisible by 7
d6d7d8=572 is divisible by 11
d7d8d9=728 is divisible by 13
d8d9d10=289 is divisible by 17
Find the sum of all 0 to 9 pandigital numbers with this property.
"""
from itertools import permutations
p = permutations('0123456789')
solution = 0
for digits in p:
if (int(''.join(digits[7:10])) % 17 == 0
and
int(''.join(digits[6:9])) % 13 == 0
and
int(''.join(digits[5:8])) % 11 == 0
and
int(''.join(digits[4:7])) % 7 == 0
and
int(''.join(digits[3:6])) % 5 == 0
and
int(''.join(digits[2:5])) % 3 == 0
and
int(''.join(digits[1:4])) % 2 == 0):
solution += int(''.join(digits))
print(solution)