d269909faa
* fix: clean-up Project Euler 381-400 * fix: missing image extension * fix: missing subscripts Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
53 lines
1.7 KiB
Markdown
53 lines
1.7 KiB
Markdown
---
|
|
id: 5900f4f71000cf542c51000a
|
|
title: 'Problem 395: Pythagorean tree'
|
|
challengeType: 5
|
|
forumTopicId: 302060
|
|
dashedName: problem-395-pythagorean-tree
|
|
---
|
|
|
|
# --description--
|
|
|
|
The Pythagorean tree is a fractal generated by the following procedure:
|
|
|
|
Start with a unit square. Then, calling one of the sides its base (in the animation, the bottom side is the base):
|
|
|
|
1. Attach a right triangle to the side opposite the base, with the hypotenuse coinciding with that side and with the sides in a 3-4-5 ratio. Note that the smaller side of the triangle must be on the 'right' side with respect to the base (see animation).
|
|
2. Attach a square to each leg of the right triangle, with one of its sides coinciding with that leg.
|
|
3. Repeat this procedure for both squares, considering as their bases the sides touching the triangle.
|
|
|
|
The resulting figure, after an infinite number of iterations, is the Pythagorean tree.
|
|
|
|
<img class="img-responsive center-block" alt="animation showing 8 iterations of the procedure" src="https://cdn.freecodecamp.org/curriculum/project-euler/pythagorean-tree.gif" style="background-color: white; padding: 10px;">
|
|
|
|
It can be shown that there exists at least one rectangle, whose sides are parallel to the largest square of the Pythagorean tree, which encloses the Pythagorean tree completely.
|
|
|
|
Find the smallest area possible for such a bounding rectangle, and give your answer rounded to 10 decimal places.
|
|
|
|
# --hints--
|
|
|
|
`pythagoreanTree()` should return `28.2453753155`.
|
|
|
|
```js
|
|
assert.strictEqual(pythagoreanTree(), 28.2453753155);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function pythagoreanTree() {
|
|
|
|
return true;
|
|
}
|
|
|
|
pythagoreanTree();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|