56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
---
|
||
id: 5900f52c1000cf542c51003f
|
||
challengeType: 5
|
||
title: 'Problem 448: Average least common multiple'
|
||
videoUrl: ''
|
||
localeTitle: 问题448：平均最小公倍数
|
||
---
|
||
|
||
## Description
|
||
<section id="description">函数lcm（a，b）表示a和b的最小公倍数。设A（n）为1≤i≤n的lcm（n，i）的平均值。例如：A（2）=（2 + 2）/ 2 = 2且A（10）=（10 + 10 + 30 + 20 + 10 + 30 + 70 + 40 + 90 + 10）/ 10 = 32。 <p>令S（n）=ΣA（k）为1≤k≤n。 S（100）= 122726。 </p><p>找到S（99999999019）mod 999999017。 </p></section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler448()</code>应该返回106467648。
|
||
testString: 'assert.strictEqual(euler448(), 106467648, "<code>euler448()</code> should return 106467648.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler448() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler448();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|