-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path12_highly_divisible_triangular_number.js
More file actions
75 lines (56 loc) · 1.44 KB
/
Copy path12_highly_divisible_triangular_number.js
File metadata and controls
75 lines (56 loc) · 1.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
75
'use strict'
/*
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?
Answer: 76576500
Completed on Fri, 22 Feb 2019, 08:52
*/
const divisors = n => {
const divs = []
for(let i = 0; i <= Math.sqrt(n) ; i++) {
if(n%i===0) {
if(n/i === i) {
divs.push(i)
} else {
divs.push(i, n/i)
}
}
}
return {divs}
}
const getTriangles = () => {
const angles = []
for(let i = 1; i < 15000; i++) {
let sum = 0
for(let j = i; j > 0; j--) {
sum += j
}
angles.push(sum)
}
return angles
}
const triangular = () => {
const angles = getTriangles()
const allDiffs = []
for(let i = 0; i<angles.length; i++) {
const {divs} = divisors(angles[i])
allDiffs.push(divs)
if(divs.length >= 500) {
return {triangular_number: angles[i], divisors: divs.length}
}
}
const result = allDiffs.map(div => div.length)
return (Math.max(...result))
}
console.log("Problem 12: ", triangular())