freeCodeCamp/problem-218-perfect-right-angled-triangles.english.md at 81a0c0c8e07a6c3a4f99228a8af10967fa0c53d9

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

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f4461000cf542c50ff59	5	Problem 218: Perfect right-angled triangles

Description

Consider the right angled triangle with sides a=7, b=24 and c=25. The area of this triangle is 84, which is divisible by the perfect numbers 6 and 28. Moreover it is a primitive right angled triangle as gcd(a,b)=1 and gcd(b,c)=1. Also c is a perfect square.

We will call a right angled triangle perfect if -it is a primitive right angled triangle -its hypotenuse is a perfect square

We will call a right angled triangle super-perfect if -it is a perfect right angled triangle and -its area is a multiple of the perfect numbers 6 and 28.

How many perfect right-angled triangles with c≤1016 exist that are not super-perfect?

Instructions

Tests

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

Challenge Seed

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

euler218();

Solution

// solution required

1.3 KiB Raw Blame History