freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-141-investigating-p...

22 lines
782 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f3f91000cf542c50ff0b
title: 问题141调查渐进数n它们也是正方形
challengeType: 5
videoUrl: ''
---
# --description--
正整数n除以d商和余数分别为q和r。另外dq和r是几何序列中的连续正整数项但不一定是该顺序。例如58除以6具有商9和余数4.还可以看出4,6,9是几何序列中的连续项公共比率3/2。我们将这样的数字称为n进步。一些渐进的数字例如9和10404 = 1022恰好也是完美的正方形。所有渐进完美正方形的总和低于十万是124657.找到所有渐进完美正方形的总和低于一万亿1012
# --hints--
`euler141()`应该返回878454337159。
```js
assert.strictEqual(euler141(), 878454337159);
```
# --solutions--