-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathHighly Divisble Triangular Number.py
More file actions
95 lines (61 loc) · 1.98 KB
/
Highly Divisble Triangular Number.py
File metadata and controls
95 lines (61 loc) · 1.98 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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
from math import sqrt
from collections import Counter
from functools import reduce
'''
Problem 12
The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
Let us list the factors of the first seven triangle numbers:
1: 1
3: 1,3
6: 1,2,3,6
10: 1,2,5,10
15: 1,3,5,15
21: 1,3,7,21
28: 1,2,4,7,14,28
We can see that 28 is the first triangle number to have over five divisors.
What is the value of the first triangle number to have over five hundred divisors?
'''
def generateTriangularNumbers():
n = 7
while True:
num = (n * (n + 1))/2
yield int(num) if num % 2 == 0 else 0
n += 1
def generatePrimeNumbers():
number = 2
c = 0
while True:
if not (number % 2 == 0 and number > 2):
for divisor in range(3, int(sqrt(number))+1, 2):
if number % divisor == 0:
c = 1
break
if c != 1:
yield number
number += 1
c = 0
def primeFactorizeNumber(currentNumber):
primeNumbers = generatePrimeNumbers()
output = []
while currentNumber > 1:
factor = next(primeNumbers)
if currentNumber % factor == 0:
output.append(factor)
currentNumber /= factor
primeNumbers = generatePrimeNumbers()
else:
continue
return output
def main():
c = True
triangularNumbers = generateTriangularNumbers()
while c:
currentNumber = next(triangularNumbers)
if currentNumber != 0:
powerCount = list(Counter(primeFactorizeNumber(currentNumber)).values())
numberOfFactors = reduce(lambda x, y: x * y, map(lambda x: x + 1, powerCount))
if numberOfFactors > 500:
print(currentNumber)
c = False
main()