freeCodeCamp/problem-57-square-root-convergents.english.md at 1f310d8c5877a13cf67fbfaad323b4a558a0ac3c

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.3 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f3a51000cf542c50feb8	5	Problem 57: Square root convergents

Description

It is possible to show that the square root of two can be expressed as an infinite continued fraction. √ 2 = 1 + 1/(2 + 1/(2 + 1/(2 + ... ))) = 1.414213... By expanding this for the first four iterations, we get: 1 + 1/2 = 3/2 = 1.5 1 + 1/(2 + 1/2) = 7/5 = 1.4 1 + 1/(2 + 1/(2 + 1/2)) = 17/12 = 1.41666... 1 + 1/(2 + 1/(2 + 1/(2 + 1/2))) = 41/29 = 1.41379... The next three expansions are 99/70, 239/169, and 577/408, but the eighth expansion, 1393/985, is the first example where the number of digits in the numerator exceeds the number of digits in the denominator. In the first one-thousand expansions, how many fractions contain a numerator with more digits than denominator?

Instructions

Tests

tests:
  - text: <code>euler57()</code> should return 153.
    testString: assert.strictEqual(euler57(), 153, '<code>euler57()</code> should return 153.');

Challenge Seed

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

euler57();

Solution

// solution required

1.3 KiB Raw Blame History