freeCodeCamp/problem-136-singleton-difference.english.md at decf1ece992556d19da5f9d0c2a948a182c0db55

Files

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.0 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f3f51000cf542c50ff07	5	false	Problem 136: Singleton difference	301764

Description

The positive integers, x, y, and z, are consecutive terms of an arithmetic progression. Given that n is a positive integer, the equation, x2 − y2 − z2 = n, has exactly one solution when n = 20: 132 − 102 − 72 = 20 In fact there are twenty-five values of n below one hundred for which the equation has a unique solution. How many values of n less than fifty million have exactly one solution?

Instructions

Tests

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

Challenge Seed

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

euler136();

Solution

// solution required

1.0 KiB Raw Blame History Unescape Escape