56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
||
id: 5900f4421000cf542c50ff55
|
||
challengeType: 5
|
||
title: 'Problem 214: Totient Chains'
|
||
videoUrl: ''
|
||
localeTitle: 问题214个欧拉链
|
||
---
|
||
|
||
## Description
|
||
<section id="description">设φ是欧拉的函数,即对于自然数n,φ(n)是k的数,1≤k≤n,gcd(k,n)= 1。 <p>通过迭代φ,每个正整数产生以1结尾的数字递减的链。例如,如果我们从5开始,则生成序列5,4,2,1。以下列出了长度为4的所有链条: </p><p> 5,4,2,1 7,6,2,1 8,4,2,1 9,6,2,1 10,4,2,1 12,4,2,1 14,6,2,1 18 ,6,2,1 </p><p>这些链中只有两个以素数开头,它们的总和为12。 </p><p>所有小于40000000的素数的总和是多少,它产生一个长度为25的链? </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler214()</code>应该返回1677366278943。
|
||
testString: 'assert.strictEqual(euler214(), 1677366278943, "<code>euler214()</code> should return 1677366278943.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler214() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler214();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|