Back to Freecodecamp

Problem 276: Primitive Triangles

curriculum/challenges/english/blocks/project-euler-problems-201-to-300/5900f4801000cf542c50ff93.md

latest591 B
Original Source

--description--

Consider the triangles with integer sides $a$, $b$ and $c$ with $a ≤ b ≤ c$.

An integer sided triangle $(a,b,c)$ is called primitive if $gcd(a,b,c) = 1$.

How many primitive integer sided triangles exist with a perimeter not exceeding $10\,000\,000$?

--hints--

primitiveTriangles() should return 5777137137739633000.

js
assert.strictEqual(primitiveTriangles(), 5777137137739633000);

--seed--

--seed-contents--

js
function primitiveTriangles() {

  return true;
}

primitiveTriangles();

--solutions--

js
// solution required