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

---
id: 5900f4671000cf542c50ff7a
title: 'Problem 251: Cardano Triplets'
challengeType: 5
forumTopicId: 301899
dashedName: problem-251-cardano-triplets
---

# --description--

A triplet of positive integers (a,b,c) is called a Cardano Triplet if it satisfies the condition:

For example, (2,1,5) is a Cardano Triplet.

There exist 149 Cardano Triplets for which a+b+c ≤ 1000.

Find how many Cardano Triplets exist such that a+b+c ≤ 110,000,000.

# --hints--

`euler251()` should return 18946051.

```js
assert.strictEqual(euler251(), 18946051);
```

# --seed--

## --seed-contents--

```js
function euler251() {

  return true;
}

euler251();
```

# --solutions--

```js
// solution required
```