freeCodeCamp/problem-378-triangle-triples.english.md at 81a0c0c8e07a6c3a4f99228a8af10967fa0c53d9

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.1 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f4e61000cf542c50fff9	5	Problem 378: Triangle Triples

Description

Let T(n) be the nth triangle number, so T(n) =

n (n+1)2

Let dT(n) be the number of divisors of T(n). E.g.: T(7) = 28 and dT(7) = 6.

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.

Find Tr(60 000 000). Give the last 18 digits of your answer.

Instructions

Tests

tests:
  - text: <code>euler378()</code> should return 147534623725724700.
    testString: assert.strictEqual(euler378(), 147534623725724700, '<code>euler378()</code> should return 147534623725724700.');

Challenge Seed

function euler378() {
  // Good luck!
  return true;
}

euler378();

Solution

// solution required

1.1 KiB Raw Blame History Unescape Escape