---
id: 5900f4801000cf542c50ff93
challengeType: 5
title: 'Problem 276: Primitive Triangles'
---

## Description
<section id='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?
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

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

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

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

euler276();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>
