56 lines
1.1 KiB
Markdown
56 lines
1.1 KiB
Markdown
|
---
|
|||
|
|
id: 5900f3ce1000cf542c50fee0
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 97: Large non-Mersenne prime'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题97：大的非梅森素数
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description"> 1999年发现了第一个发现超过一百万个数字的已知素数，它是形式为26972593-1的梅森素数;它包含正好2,098,960位数字。随后发现其他形式为2p-1的梅森素数包含更多数字。然而，在2004年发现了一个巨大的非梅森素数，其中包含2,357,207个数字：28433×27830457 + 1。找到此素数的最后十位数字。 </section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler97()</code>应该返回8739992577。
|
|||
|
|
testString: 'assert.strictEqual(euler97(), 8739992577, "<code>euler97()</code> should return 8739992577.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler97() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler97();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|