-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathP045.py
More file actions
75 lines (60 loc) · 1.81 KB
/
P045.py
File metadata and controls
75 lines (60 loc) · 1.81 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
75
# -*- coding: utf-8 -*-
#==============================================================================
# Triangle, pentagonal, and hexagonal numbers are generated by the following formulae:
#
# Triangle Tn=n(n+1)/2 1, 3, 6, 10, 15, ...
# Pentagonal Pn=n(3n−1)/2 1, 5, 12, 22, 35, ...
# Hexagonal Hn=n(2n−1) 1, 6, 15, 28, 45, ...
# It can be verified that T285 = P165 = H143 = 40755.
#
# Find the next triangle number that is also pentagonal and hexagonal.
#==============================================================================
class Tri():
def __init__(self, n=1):
self.n = n
self.val = self.GetVal(n)
def GetVal(self, n):
return n*(n+1)/2
def Next(self):
self.n += 1
self.val = self.GetVal(self.n)
return self.val
class Pen():
def __init__(self, n=1):
self.n = n
self.val = self.GetVal(n)
def GetVal(self, n):
return n*(3*n-1)/2
def Next(self):
self.n += 1
self.val = self.GetVal(self.n)
return self.val
class Hex():
def __init__(self, n=1):
self.n = n
self.val = self.GetVal(n)
def GetVal(self, n):
return n*(2*n-1)
def Next(self):
self.n += 1
self.val = self.GetVal(self.n)
return self.val
T = Tri(285)
P = Pen(165)
H = Hex(143)
Tn = T.Next()
Pn = P.Next()
Hn = H.Next()
# Note if you look at T and H series, the H series is every other number in the T series. Thus we can skip calculating the T series and only compare the P and H series.
#while not (Tn==Pn==Hn):
while not (Pn==Hn):
Small = min(Pn, Hn)
# Small = min(Tn, Pn, Hn)
# if Small==Tn:
# Tn = T.Next()
if Small==Pn:
Pn = P.Next()
if Small==Hn:
Hn = H.Next()
print P.n, H.n, Hn
# 31977 27693 1533776805