56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
||
id: 5900f4d61000cf542c50ffe9
|
||
challengeType: 5
|
||
title: 'Problem 362: Squarefree factors'
|
||
videoUrl: ''
|
||
localeTitle: 问题362:无广义因子
|
||
---
|
||
|
||
## Description
|
||
<section id="description">考虑数字54. 54可以用7种不同的方式分解为大于1:54,2×27,3×18,6×9,3×3×6,2×3×9和2×的一个或多个因子3×3×3。如果我们要求所有因子都是无平方的,则只剩下两种方式:3×3×6和2×3×3×3。 <p>让我们调用Fsf(n)n可以计算为一个或多个大于1的无平方因子的方式的数量,因此Fsf(54)= 2。 </p><p>对于k = 2到n,令S(n)为ΣFsf(k)。 </p><p> S(100)= 193。 </p><p>找到S(10 000 000 000)。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler362()</code>应该返回457895958010。
|
||
testString: 'assert.strictEqual(euler362(), 457895958010, "<code>euler362()</code> should return 457895958010.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler362() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler362();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|