56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f4be1000cf542c50ffd0
|
||
challengeType: 5
|
||
title: 'Problem 337: Totient Stairstep Sequences'
|
||
videoUrl: ''
|
||
localeTitle: 问题337欧拉序列阶梯
|
||
---
|
||
|
||
## Description
|
||
<section id="description">令{a1，a2，...，an}为长度为n的整数序列，使得：a1 = 6，对于所有1≤i<n：φ（ai）<φ（ai + 1）<ai <ai + 11令S（N）为具有≤N的这种序列的数目。例如，S（10）= 4：{6}，{6,8}，{6,8,9}和{6,10}。我们可以验证S（100）= 482073668和S（10 000）mod 108 = 73808307。 <p>找到S（20 000 000）mod 108。 </p><p> 1φ表示欧拉的函数。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler337()</code>应该返回85068035。
|
||
testString: 'assert.strictEqual(euler337(), 85068035, "<code>euler337()</code> should return 85068035.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler337() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler337();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|