freeCodeCamp/problem-192-best-approximations.english.md at 088acf45d91e7e32081eabe9660beefb2e9c0172

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
5900f42c1000cf542c50ff3f	5	Problem 192: Best Approximations

Description

Let x be a real number. A best approximation to x for the denominator bound d is a rational number r/s in reduced form, with s ≤ d, such that any rational number which is closer to x than r/s has a denominator larger than d:

|p/q-x| < |r/s-x| ⇒ q > d

For example, the best approximation to √13 for the denominator bound 20 is 18/5 and the best approximation to √13 for the denominator bound 30 is 101/28.

Find the sum of all denominators of the best approximations to √n for the denominator bound 1012, where n is not a perfect square and 1 < n ≤ 100000.

Instructions

Tests

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

Challenge Seed

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

euler192();

Solution

// solution required

1.3 KiB Raw Blame History