freeCodeCamp/problem-135-same-differences.chinese.md at b99d78858be1d1ab1aae3417e00c38a458a72ae3

Files

Oliver Eyton-Williams 61460c8601 fix: insert blank line after ```

search and replace ```\n< with ```\n\n< to ensure there's an empty line
before closing tags

2020-08-16 04:45:20 +05:30

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3f31000cf542c50ff06	5	Problem 135: Same differences		问题135：同样的差异

Description

给定正整数，x，y和z是算术级数的连续项，正整数n的最小值，其中等式x2-y2-z2 = n，恰好有两个解是n = 27：342 - 272 - 202 = 122 - 92 - 62 = 27事实证明，n = 1155是具有正好十个解的最小值。 n不到一百万的多少个值有十个不同的解？

tests:
  - text: <code>euler135()</code>应该返回4989。
    testString: assert.strictEqual(euler135(), 4989);

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

euler135();

// solution required

/section>