freeCodeCamp/curriculum/challenges/en/08-coding-interview-prep/project-euler/problem-276-primitive-triangles.en.md

id, challengeType, title

id	challengeType	title
5900f4801000cf542c50ff93	5	Problem 276: Primitive Triangles

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?

Instructions

Tests

- text: <code>euler276()</code> should return 5777137137739633000.
  testString: 'assert.strictEqual(euler276(), 5777137137739633000, ''<code>euler276()</code> should return 5777137137739633000.'');'

Challenge Seed

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

euler276();

Solution

// solution required