freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-251-cardano-triplets.spanish.md

---
id: 5900f4671000cf542c50ff7a
challengeType: 5
title: 'Problem 251: Cardano Triplets'
videoUrl: ''
localeTitle: 'Problema 251: Cardano Triplets'
---

## Description
<section id="description"> Un triplete de enteros positivos (a, b, c) se llama Cardano Triplet si cumple con la condición: <p> Por ejemplo, (2,1,5) es un Triplete Cardano. </p><p> Existen 149 trillizos de Cardano para los cuales a + b + c ≤ 1000. </p><p> Halla cuántos trillizos Cardano existen de modo que a + b + c ≤ 110,000,000. </p></section>

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

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler251()</code> debe devolver 18946051.
    testString: 'assert.strictEqual(euler251(), 18946051, "<code>euler251()</code> should return 18946051.");'

```

</section>

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

<div id='js-seed'>

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

euler251();

```

</div>



</section>

## Solution
<section id='solution'>

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