freeCodeCamp/problem-461-almost-pi.english.md at 908adc2c372f2c1af0c8d1c80b264c23f96fd7d7

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

1.1 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f53a1000cf542c51004c	5	false	Problem 461: Almost Pi	302136

Description

Let fn(k) = ek/n - 1, for all non-negative integers k. Remarkably, f200(6) + f200(75) + f200(89) + f200(226) = 3.141592644529… ≈ π. In fact, it is the best approximation of π of the form fn(a) + fn(b) + fn(c) + fn(d) for n = 200. Let g(n) = a2 + b2 + c2 + d 2 for a, b, c, d that minimize the error: | fn(a) + fn(b) + fn(c) + fn(d) - π| (where |x| denotes the absolute value of x). You are given g(200) = 62 + 752 + 892 + 2262 = 64658. Find g(10000).

Instructions

Tests

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

Challenge Seed

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

euler461();

Solution

// solution required

1.1 KiB Raw Blame History Unescape Escape