--- id: 5900f3f31000cf542c50ff06 challengeType: 5 title: 'Problem 135: Same differences' videoUrl: '' localeTitle: 问题135:同样的差异 --- ## Description 给定正整数,x,y和z是算术级数的连续项,正整数n的最小值,其中等式x2-y2-z2 = n,恰好有两个解是n = 27:342 - 272 - 202 = 122 - 92 - 62 = 27事实证明,n = 1155是具有正好十个解的最小值。 n不到一百万的多少个值有十个不同的解? ## Instructions ## Tests ```yml tests: - text: euler135()应该返回4989。 testString: 'assert.strictEqual(euler135(), 4989, "euler135() should return 4989.");' ``` ## Challenge Seed ```js function euler135() { // Good luck! return true; } euler135(); ``` ## Solution ```js // solution required ```
euler135()