2018-10-10 22:03:03 +00:00
---
id: 5900f4e61000cf542c50fff9
2021-02-06 04:42:36 +00:00
title: 'Problem 378: Triangle Triples'
2018-10-10 22:03:03 +00:00
challengeType: 5
2021-02-06 04:42:36 +00:00
forumTopicId: 302040
2021-01-13 02:31:00 +00:00
dashedName: problem-378-triangle-triples
2018-10-10 22:03:03 +00:00
---
2020-12-16 07:37:30 +00:00
# --description--
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
Let T(n) be the nth triangle number, so T(n) =
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
n (n+1)2
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
Let dT(n) be the number of divisors of T(n). E.g.: T(7) = 28 and dT(7) = 6.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
Let Tr(n) be the number of triples (i, j, k) such that 1 ≤ i < j < k ≤ n and dT(i) > dT(j) > dT(k). Tr(20) = 14, Tr(100) = 5772 and Tr(1000) = 11174776.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
Find Tr(60 000 000). Give the last 18 digits of your answer.
2018-10-10 22:03:03 +00:00
2020-12-16 07:37:30 +00:00
# --hints--
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
`euler378()` should return 147534623725724700.
2018-10-10 22:03:03 +00:00
```js
2020-12-16 07:37:30 +00:00
assert.strictEqual(euler378(), 147534623725724700);
2018-10-10 22:03:03 +00:00
```
2020-08-13 15:24:35 +00:00
2021-01-13 02:31:00 +00:00
# --seed--
## --seed-contents--
```js
function euler378() {
return true;
}
euler378();
```
2020-12-16 07:37:30 +00:00
# --solutions--
2021-01-13 02:31:00 +00:00
```js
// solution required
```