69 lines
1.7 KiB
Markdown
69 lines
1.7 KiB
Markdown
---
|
||
id: 5900f4971000cf542c50ffaa
|
||
challengeType: 5
|
||
title: 'Problem 299: Three similar triangles'
|
||
---
|
||
|
||
## Description
|
||
<section id='description'>
|
||
Four points with integer coordinates are selected:A(a, 0), B(b, 0), C(0, c) and D(0, d),
|
||
with 0 < a < b and 0 < c < d.
|
||
Point P, also with integer coordinates, is chosen on the line AC so that the three triangles ABP, CDP and BDP are all similar.
|
||
|
||
It is easy to prove that the three triangles can be similar, only if a=c.
|
||
|
||
So, given that a=c, we are looking for triplets (a,b,d) such that at least one point P (with integer coordinates) exists on AC, making the three triangles ABP, CDP and BDP all similar.
|
||
|
||
For example, if (a,b,d)=(2,3,4), it can be easily verified that point P(1,1) satisfies the above condition.
|
||
Note that the triplets (2,3,4) and (2,4,3) are considered as distinct, although point P(1,1) is common for both.
|
||
|
||
If b+d < 100, there are 92 distinct triplets (a,b,d) such that point P exists.
|
||
If b+d < 100 000, there are 320471 distinct triplets (a,b,d) such that point P exists.
|
||
If b+d < 100 000 000, how many distinct triplets (a,b,d) are there such that point P exists?
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id='instructions'>
|
||
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler299()</code> should return 549936643.
|
||
testString: 'assert.strictEqual(euler299(), 549936643, "<code>euler299()</code> should return 549936643.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler299() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler299();
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|