61460c8601
search and replace ```\n< with ```\n\n< to ensure there's an empty line before closing tags
67 lines
1000 B
Markdown
67 lines
1000 B
Markdown
---
|
||
id: 5900f5191000cf542c51002c
|
||
challengeType: 5
|
||
title: 'Problem 429: Sum of squares of unitary divisors'
|
||
videoUrl: ''
|
||
localeTitle: 问题429：单一除数的平方和
|
||
---
|
||
|
||
## Description
|
||
<section id="description">
|
||
数为n的unit除数d是n的除数，其性质为gcd（d，n / d）= 1。
|
||
4的除数！ = 24是1、3、8和24。
|
||
它们的平方和是12 + 32 + 82 + 242 = 650。
|
||
|
||
|
||
令S（n）表示n的一元除数的平方和。 因此，S（4！）＝ 650。
|
||
|
||
|
||
求S（100000000！）取模1000000009。
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler429()</code>应该返回98792821。
|
||
testString: assert.strictEqual(euler429(), 98792821);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler429() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler429();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|