2018-10-08 17:51:51 +00:00
---
2018-10-10 20:20:40 +00:00
id: 5900f4801000cf542c50ff93
2018-10-08 17:51:51 +00:00
challengeType: 5
title: 'Problem 276: Primitive Triangles'
2018-10-10 20:20:40 +00:00
videoUrl: ''
localeTitle: 'Problema 276: triángulos primitivos'
2018-10-08 17:51:51 +00:00
---
## Description
2018-10-10 20:20:40 +00:00
< 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 >
2018-10-08 17:51:51 +00:00
## Instructions
2018-10-10 20:20:40 +00:00
< section id = "instructions" >
2018-10-08 17:51:51 +00:00
< / 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();
2018-10-10 20:20:40 +00:00
2018-10-08 17:51:51 +00:00
```
< / div >
< / section >
## Solution
< section id = 'solution' >
```js
// solution required
```
< / section >