freeCodeCamp/problem-251-cardano-triplets.english.md at 80438cac3eef13eb3f3f5ea11faaa9b92d72e2d7

2020-09-15 22:27:40 +05:30

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f4671000cf542c50ff7a	5	Problem 251: Cardano Triplets	301899

Description

A triplet of positive integers (a,b,c) is called a Cardano Triplet if it satisfies the condition:

For example, (2,1,5) is a Cardano Triplet.

There exist 149 Cardano Triplets for which a+b+c ≤ 1000.

Find how many Cardano Triplets exist such that a+b+c ≤ 110,000,000.

tests:
  - text: <code>euler251()</code> should return 18946051.
    testString: assert.strictEqual(euler251(), 18946051);

function euler251() {

  return true;
}

euler251();

// solution required