-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblem 26
More file actions
32 lines (25 loc) · 704 Bytes
/
Copy pathproblem 26
File metadata and controls
32 lines (25 loc) · 704 Bytes
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
"""
A unit fraction contains 1 in the numerator. The decimal remresentation of the unit fractions with denominators 2 to 10 are given:
1/2 = 0.5
1/3 = 0.(3)
1/4 = 0.25
1/5 = 0.2
1/6 = 0.1(6)
1/7 = 0.(142857)
1/8 = 0.125
1/9 = 0.(1)
1/10 = 0.1
Where 0.1(6) means 0.166666..., and has a 1-digit recurring cycle. It can be seen that 1/7 has a 6-digit recurring cycle.
Find the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction mart.
"""
import math
num = longest = 1
for n in range(3, 1000, 2):
if n % 5 == 0:
continue
m = 1
while (pow(10,m)) % n != 1:
m += 1
if m > longest:
num, longest = n, m
print (num)