- Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProblem33.py
More file actions
Latest commit
74 lines (48 loc) · 2.44 KB
/
Copy pathProblem33.py
File metadata and controls
74 lines (48 loc) · 2.44 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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
"""
@author: mc-es
Problem 33
The fraction 49/98 is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that 49/98 = 4/8, which is correct, is obtained by cancelling the 9s.
We shall consider fractions like, 30/50 = 3/5, to be trivial examples.
There are exactly four non-trivial examples of this type of fraction, less than one in value, and containing two digits in the numerator and denominator.
If the product of these four fractions is given in its lowest common terms, find the value of the denominator.
Answer: 100
"""
importmath
# Finds the common digit between the numerator and denominator of a fraction.
deffindCommonDigit(numerator, denominator):
numeratorDigits=list(str(numerator))
denominatorDigits=list(str(denominator))
commonDigit=list(set(numeratorDigits) &set(denominatorDigits))
returnint(commonDigit[0]) ifcommonDigitelseNone
# Simplifies a fraction by removing the common digit from both the numerator and denominator.
defsimplifyFraction(numerator, denominator, commonDigit):
numeratorDigits=list(str(numerator))
denominatorDigits=list(str(denominator))
numeratorDigits.remove(str(commonDigit))
denominatorDigits.remove(str(commonDigit))
newNumerator=int(numeratorDigits[0])
newDenominator=int(denominatorDigits[0])
returnnewNumerator, newDenominator
# Checks if a fraction satisfies the curious fraction property.
defisCuriousFraction(numerator, denominator):
commonDigit=findCommonDigit(numerator, denominator)
ifnotcommonDigit:
returnFalse
newNumerator, newDenominator=simplifyFraction(
numerator, denominator, commonDigit)
ifnewDenominator==0:
returnFalse
returnnumerator/denominator==newNumerator/newDenominator
productNumerator=1
productDenominator=1
fornumeratorinrange(10, 100):
fordenominatorinrange(numerator+1, 100):
ifisCuriousFraction(numerator, denominator):
commonDigit=findCommonDigit(numerator, denominator)
newNumerator, newDenominator=simplifyFraction(
numerator, denominator, commonDigit)
productNumerator*=newNumerator
productDenominator*=newDenominator
gcd=math.gcd(productNumerator, productDenominator)
smallestProduct=productDenominator//gcd
print(smallestProduct)