freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-218-perfect-right-angled-triangles.md
Oliver Eyton-Williams 0bd52f8bd1
Feat: add new Markdown parser (#39800)
and change all the challenges to new `md` format.
2020-11-27 10:02:05 -08:00

1016 B

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

--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?

--hints--

euler218() should return 0.

assert.strictEqual(euler218(), 0);

--seed--

--seed-contents--

function euler218() {

  return true;
}

euler218();

--solutions--

// solution required