56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
|
---
|
|||
|
|
id: 5900f53c1000cf542c51004e
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 463: A weird recurrence relation'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题463：一种奇怪的复发关系
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">函数$ f $定义为所有正整数，如下所示：$ f（1）= 1 $ $ f（3）= 3 $ $ f（2n）= f（n）$ $ f（4n + 1）= 2f （2n + 1） - f（n）$ $ f（4n + 3）= 3f（2n + 1） - 2f（n）$ <p>函数$ S（n）$定义为$ \ sum_ {i = 1} ^ {n} f（i）$。 $ S（8）= 22 $和$ S（100）= 3604 $。找到$ S（3 ^ {37}）$。给出答案的最后9位数字。 </p></section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler463()</code>应该返回808981553。
|
|||
|
|
testString: 'assert.strictEqual(euler463(), 808981553, "<code>euler463()</code> should return 808981553.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler463() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler463();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|