---
id: 5900f4de1000cf542c50fff1
challengeType: 5
title: 'Problem 370: Geometric triangles'
---

## Description
<section id='description'>
Let us define a geometric triangle as an integer sided triangle with sides a ≤ b ≤ c so that its sides form a geometric progression, i.e. b2 = a · c . 

An example of such a geometric triangle is the triangle with sides a = 144, b = 156 and c = 169.

There are 861805 geometric triangles with perimeter ≤ 106 .

How many geometric triangles exist with perimeter ≤ 2.5·1013 ?
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler370()</code> should return 41791929448408.
    testString: assert.strictEqual(euler370(), 41791929448408, '<code>euler370()</code> should return 41791929448408.');

```

</section>

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

<div id='js-seed'>

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

euler370();
```

</div>



</section>

## Solution
<section id='solution'>

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