freeCodeCamp/problem-251-cardano-triplets.english.md at 908adc2c372f2c1af0c8d1c80b264c23f96fd7d7

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

947 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4671000cf542c50ff7a	5	false	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

947 B Raw Blame History