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

---
id: 5900f4801000cf542c50ff93
challengeType: 5
title: 'Problem 276: Primitive Triangles'
videoUrl: ''
localeTitle: 'Problema 276: triángulos primitivos'
---

## Description
<section id="description"> Considera los triángulos con lados enteros a, b y c con a ≤ b ≤ c. Un triángulo de lados enteros (a, b, c) se llama primitivo si gcd (a, b, c) = 1. ¿Cuántos triángulos de lados enteros primitivos existen con un perímetro que no exceda de 10 000 000? </section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler276()</code> debe devolver 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>