65 lines
1.0 KiB
Markdown
65 lines
1.0 KiB
Markdown
---
|
|
id: 5900f4e11000cf542c50fff4
|
|
challengeType: 5
|
|
title: 'Problem 373: Circumscribed Circles'
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
Every triangle has a circumscribed circle that goes through the three vertices.
|
|
Consider all integer sided triangles for which the radius of the circumscribed circle is integral as well.
|
|
|
|
|
|
Let S(n) be the sum of the radii of the circumscribed circles of all such triangles for which the radius does not exceed n.
|
|
|
|
S(100)=4950 and S(1200)=1653605.
|
|
|
|
|
|
Find S(107).
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler373()</code> should return 727227472448913.
|
|
testString: 'assert.strictEqual(euler373(), 727227472448913, "<code>euler373()</code> should return 727227472448913.");'
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler373() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler373();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|