freeCodeCamp/problem-75-singular-integer-right-triangles.english.md at 9e4583b1f36a4ecaabc48b51e1445bb992692676

Files

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.4 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f3b71000cf542c50feca	5	Problem 75: Singular integer right triangles

Description

It turns out that 12 cm is the smallest length of wire that can be bent to form an integer sided right angle triangle in exactly one way, but there are many more examples. 12 cm: (3,4,5)24 cm: (6,8,10)30 cm: (5,12,13)36 cm: (9,12,15)40 cm: (8,15,17)48 cm: (12,16,20) In contrast, some lengths of wire, like 20 cm, cannot be bent to form an integer sided right angle triangle, and other lengths allow more than one solution to be found; for example, using 120 cm it is possible to form exactly three different integer sided right angle triangles. 120 cm: (30,40,50), (20,48,52), (24,45,51) Given that L is the length of the wire, for how many values of L ≤ 1,500,000 can exactly one integer sided right angle triangle be formed?

Instructions

Tests

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

Challenge Seed

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

euler75();

Solution

// solution required

1.4 KiB Raw Blame History