freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-251-cardano-triplets.english.md

id, challengeType, title

id	challengeType	title
5900f4671000cf542c50ff7a	5	Problem 251: Cardano Triplets

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.

Instructions

Tests

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

Challenge Seed

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

euler251();

Solution

// solution required