2018-10-10 18:03:03 -04:00
|
|
|
|
---
|
|
|
|
|
id: 5900f53d1000cf542c51004f
|
|
|
|
|
challengeType: 5
|
|
|
|
|
videoUrl: ''
|
2020-10-01 17:54:21 +02:00
|
|
|
|
title: 问题464:莫比乌斯函数和区间
|
2018-10-10 18:03:03 -04:00
|
|
|
|
---
|
|
|
|
|
|
|
|
|
|
## Description
|
|
|
|
|
<section id="description"> Möbius函数,表示为μ(n),定义为:μ(n)=( - 1)ω(n),如果n是无平方(其中ω(n)是n的不同素因子的数量)μ(n) )如果n不是无平方,则= 0。 <p>令P(a,b)为区间[a,b]中的整数n,使得μ(n)= 1.设N(a,b)为区间[a,b]中的整数n这样μ(n)= -1。例如,P(2,10)= 2且N(2,10)= 4。 </p><p>令C(n)为整数对(a,b)的数目,使得:1≤a≤b≤n,99·N(a,b)≤100·P(a,b),和99·P( a,b)≤100·N(a,b)。 </p><p>例如,C(10)= 13,C(500)= 16676和C(10000)= 20155319。 </p><p>找C(2 000 000)。 </p></section>
|
|
|
|
|
|
|
|
|
|
## Instructions
|
|
|
|
|
<section id="instructions">
|
|
|
|
|
</section>
|
|
|
|
|
|
|
|
|
|
## Tests
|
|
|
|
|
<section id='tests'>
|
|
|
|
|
|
|
|
|
|
```yml
|
|
|
|
|
tests:
|
|
|
|
|
- text: <code>euler464()</code>应返回198775297232878。
|
2020-02-18 01:40:55 +09:00
|
|
|
|
testString: assert.strictEqual(euler464(), 198775297232878);
|
2018-10-10 18:03:03 -04:00
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
</section>
|
|
|
|
|
|
|
|
|
|
## Challenge Seed
|
|
|
|
|
<section id='challengeSeed'>
|
|
|
|
|
|
|
|
|
|
<div id='js-seed'>
|
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
function euler464() {
|
|
|
|
|
// Good luck!
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
euler464();
|
|
|
|
|
|
|
|
|
|
```
|
|
|
|
|
|
|
|
|
|
</div>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
</section>
|
|
|
|
|
|
|
|
|
|
## Solution
|
|
|
|
|
<section id='solution'>
|
|
|
|
|
|
|
|
|
|
```js
|
|
|
|
|
// solution required
|
|
|
|
|
```
|
2020-08-13 17:24:35 +02:00
|
|
|
|
|
|
|
|
|
/section>
|