Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-251-cardano-triplets.english.md
Oliver Eyton-Williams bd68b70f3d Feat: hide blocks not challenges (#39504)
* fix: remove isHidden flag from frontmatter

* fix: add isUpcomingChange

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

* feat: hide blocks not challenges

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
2020-09-03 15:07:40 -07:00

931 B

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.

Instructions

Tests

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

Challenge Seed

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

euler251();

Solution

// solution required