56 lines
1.4 KiB
Markdown
56 lines
1.4 KiB
Markdown
|
---
|
|||
|
id: 5900f4571000cf542c50ff69
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 234: Semidivisible numbers'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题234:半透明数字
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description">对于n≥4的整数,我们定义n的下素数根,用lps(n)表示,最大素数≤√n和n的上素数根,ups(n),作为最小素数≥ √N。因此,例如,lps(4)= 2 = ups(4),lps(1000)= 31,ups(1000)= 37.让我们称一个整数n≥4半可分,如果lps(n)和ups之一(n)除n,但不是两者。 <p>不可超过15的半可分数之和为30,数字为8,10和12. 15不是半可分的,因为它是lps(15)= 3和ups(15)= 5的倍数。作为另一个例子,最多1000个的92个半可见数字的总和是34825。 </p><p>所有半数均不超过999966663333的总和是多少? </p></section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler234()</code>应该返回1259187438574927000。
|
|||
|
testString: 'assert.strictEqual(euler234(), 1259187438574927000, "<code>euler234()</code> should return 1259187438574927000.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler234() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler234();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|