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

---
id: 5900f4801000cf542c50ff93
title: 'Problem 276: Primitive Triangles'
challengeType: 5
forumTopicId: 301926
dashedName: 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?

# --hints--

`euler276()` should return 5777137137739633000.

```js
assert.strictEqual(euler276(), 5777137137739633000);
```

# --seed--

## --seed-contents--

```js
function euler276() {

  return true;
}

euler276();
```

# --solutions--

```js
// solution required
```