-
Notifications
You must be signed in to change notification settings - Fork 0
/
61_CyclicalFigurateNumbers.py
100 lines (80 loc) · 1.66 KB
/
61_CyclicalFigurateNumbers.py
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
import itertools
def is_cyclic(a, b):
a = str(a); b = str(b)
if a[-2:] == b[:2]:
return True
else:
return False
def are_cyclic(vals):
for a, b in itertools.izip(vals, vals[1:]+[vals[0]]):
a = str(a)
b = str(b)
if a[-2:] != b[:2]:
return False
return True
def pent_nums(n):
my_list = [m*(3*m-1)/2 for m in range(1, n+1)]
return my_list
def square_nums(n):
my_list = [m**2 for m in range(1, n+1)]
return my_list
def tri_nums(n):
my_list = [m*(m+1)/2 for m in range(1, n+1)]
return my_list
def pent_dict(n):
d = {}
for m in range(1, n+1):
val = m*(3*m-1)/2
key = str(val)[:2]
d.setdefault(key,[]).append(val)
return d
def tri_dict(n):
d = {}
for m in range(1, n+1):
val = m*(m+1)/2
key = str(val)[:2]
d.setdefault(key,[]).append(val)
return d
def square_dict(n):
d = {}
for m in range(1, n+1):
val = m**2
key = str(val)[:2]
d.setdefault(key,[]).append(val)
return d
def f(key, *args):
keys = []
for d in args:
try:
vals = d[key]
keys.append()
n = 200
pents = pent_dict(n)
pent_vals = pent_nums(n)
tris = tri_dict(n)
squares = square_dict(n)
for val1 in pent_vals:
key1 = str(val1)[-2:]
for val2 in squares[key1]:
key2 = str(val2)[-2:]
for val3 in tris[key2]:
print val1, val2, val3
for val2 in tris[key1]:
key2 = str(val2)[-2:]
for val3 in tris[key2]:
print val1, val2, val3
'''
def is_triangle_number(num):
floored_root = floor(sqrt(2*num))
if num == (floored_root * (floored_root + 1)/2):
return True
else:
return False
def is_hexagonal_number(num):
ceiled_root = ceil(sqrt(num/2))
if num == (ceiled_root * (2*ceiled_root-1)):
return True
else:
return False
'''
#is_cyclic([8128, 2882, 8281])