56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
|
---
|
|||
|
id: 5900f3b11000cf542c50fec4
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 69: Totient maximum'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题69大欧拉
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description"> Euler的Totient函数φ(n)[有时称为phi函数]用于确定小于n的数字的数量,这些数字是n的相对素数。例如,如1,2,4,5,7和8都小于9且相对于9,φ(9)= 6。 <p> n相对素数φ(n)n /φ(n)2 1 1 2 3 1,2 2 1.5 4 1,3 2 2 5 1,2,3,4 4 1.25 6 1,5 2 3 7 1,2, 3,4,5,6 6 1.1666 ... 8 1,3,5,7 4 2 9 1,2,4,5,7,8 6 1.5 10 1,3,7,9 4 2.5 </p><p>可以看出,对于n≤10,n = 6产生最大n /φ(n)。找到n≤1,000,000的值,其中n /φ(n)是最大值。 </p></section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler69()</code>应该返回510510。
|
|||
|
testString: 'assert.strictEqual(euler69(), 510510, "<code>euler69()</code> should return 510510.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler69() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler69();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|