freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-197-investigating-the-behaviour-of-a-recursively-defined-sequence.english.md
mrugesh 22afc2a0ca feat(learn): python certification projects (#38216)
Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>
2020-05-27 13:19:08 +05:30

957 B
Raw Blame History

id, challengeType, isHidden, title, forumTopicId
id challengeType isHidden title forumTopicId
5900f4311000cf542c50ff44 5 false Problem 197: Investigating the behaviour of a recursively defined sequence 301835

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.

Instructions

Tests

tests:
  - text: <code>euler197()</code> should return 1.710637717.
    testString: assert.strictEqual(euler197(), 1.710637717);

Challenge Seed

function euler197() {
  // Good luck!
  return true;
}

euler197();

Solution

// solution required