freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-136-singleton-difference.english.md

id, challengeType, title

id	challengeType	title
5900f3f51000cf542c50ff07	5	Problem 136: Singleton difference

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, '<code>euler136()</code> should return 2544559.');

Challenge Seed

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

euler136();

Solution

// solution required