56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
---
|
||
id: 5900f3f91000cf542c50ff0b
|
||
challengeType: 5
|
||
title: 'Problem 141: Investigating progressive numbers, n, which are also square'
|
||
videoUrl: ''
|
||
localeTitle: 问题141：调查渐进数n，它们也是正方形
|
||
---
|
||
|
||
## Description
|
||
<section id="description">正整数n除以d，商和余数分别为q和r。另外，d，q和r是几何序列中的连续正整数项，但不一定是该顺序。例如，58除以6具有商9和余数4.还可以看出，4,6,9是几何序列中的连续项（公共比率3/2）。我们将这样的数字称为n，进步。一些渐进的数字，例如9和10404 = 1022，恰好也是完美的正方形。所有渐进完美正方形的总和低于十万是124657.找到所有渐进完美正方形的总和低于一万亿（1012）。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler141()</code>应该返回878454337159。
|
||
testString: 'assert.strictEqual(euler141(), 878454337159, "<code>euler141()</code> should return 878454337159.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler141() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler141();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|