56 lines
886 B
Markdown
56 lines
886 B
Markdown
---
|
||
id: 5900f52c1000cf542c51003e
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
title: 问题447：撤回C.
|
||
---
|
||
|
||
## Description
|
||
<section id="description">对于每个整数n> 1，函数族fn，a，b由fn，a，b（x）≡ax+ b mod n定义为a，b，x整数和0 <p>对于2≤n≤N，F（N）=ΣR（n）。 F（107）≡638042271（mod 1 000 000 007）。 </p><p>求F（1014）（mod 1 000 000 007）。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler447()</code>应返回530553372。
|
||
testString: assert.strictEqual(euler447(), 530553372);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler447() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler447();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
/section>
|