freeCodeCamp/curriculum/challenges/spanish/08-coding-interview-prep/project-euler/problem-378-triangle-triples.spanish.md

---
id: 5900f4e61000cf542c50fff9
challengeType: 5
title: 'Problem 378: Triangle Triples'
videoUrl: ''
localeTitle: 'Problema 378: el triángulo se triplica'
---

## Description
<section id="description"> Sea T (n) el número n del triángulo, entonces T (n) = <p> n (n + 1) 2 </p><p> . </p><p> Sea dT (n) el número de divisores de T (n). Ej .: T (7) = 28 y dT (7) = 6. </p><p> Sea Tr (n) el número de triples (i, j, k) de manera que 1 ≤ i &lt;j &lt;k ≤ n y dT (i)&gt; dT (j)&gt; dT (k). Tr (20) = 14, Tr (100) = 5772 y Tr (1000) = 11174776. </p><p> Encontrar Tr (60 000 000). Da los últimos 18 dígitos de tu respuesta. </p></section>

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

## Tests
<section id='tests'>

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

```

</section>

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

<div id='js-seed'>

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

euler378();

```

</div>



</section>

## Solution
<section id='solution'>

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