ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
43 lines
759 B
Markdown
43 lines
759 B
Markdown
---
|
||
id: 5900f4311000cf542c50ff44
|
||
title: 'Problem 197: Investigating the behaviour of a recursively defined sequence'
|
||
challengeType: 5
|
||
forumTopicId: 301835
|
||
dashedName: problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence
|
||
---
|
||
|
||
# --description--
|
||
|
||
Given is the function f(x) = ⌊230.403243784-x2⌋ × 10-9 ( ⌊ ⌋ is the floor-function),
|
||
|
||
the sequence un is defined by u0 = -1 and un+1 = f(un).
|
||
|
||
Find un + un+1 for n = 1012. Give your answer with 9 digits after the decimal point.
|
||
|
||
# --hints--
|
||
|
||
`euler197()` should return 1.710637717.
|
||
|
||
```js
|
||
assert.strictEqual(euler197(), 1.710637717);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler197() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler197();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|