56 lines
1.3 KiB
Markdown
56 lines
1.3 KiB
Markdown
|
---
|
|||
|
|
id: 5900f3a61000cf542c50feb9
|
|||
|
|
challengeType: 5
|
|||
|
|
title: 'Problem 58: Spiral primes'
|
|||
|
|
videoUrl: ''
|
|||
|
|
localeTitle: 问题58：螺旋素数
|
|||
|
|
---
|
|||
|
|
|
|||
|
|
## Description
|
|||
|
|
<section id="description">从1开始并以下列方式逆时针旋转，形成边长为7的方形螺旋。 37 36 35 34 33 32 31 38 17 16 15 14 13 30 39 18 5 4 3 12 29 40 19 6 1 2 11 28 41 20 7 8 9 10 27 42 21 22 23 24 25 2643 44 45 46 47 48 49这是有趣的是，奇数方块位于右下角，但更有意思的是沿着两条对角线的13个数字中有8个是素数;也就是说，比例为8 /13≈62％。如果在上面的螺旋周围缠绕一个完整的新层，则将形成具有边长9的方形螺旋。如果继续这个过程，那么沿着两条对角线的素数比首先低于10％的方形螺旋的边长是多少？ </section>
|
|||
|
|
|
|||
|
|
## Instructions
|
|||
|
|
<section id="instructions">
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Tests
|
|||
|
|
<section id='tests'>
|
|||
|
|
|
|||
|
|
```yml
|
|||
|
|
tests:
|
|||
|
|
- text: <code>euler58()</code>应返回26241。
|
|||
|
|
testString: 'assert.strictEqual(euler58(), 26241, "<code>euler58()</code> should return 26241.");'
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Challenge Seed
|
|||
|
|
<section id='challengeSeed'>
|
|||
|
|
|
|||
|
|
<div id='js-seed'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
function euler58() {
|
|||
|
|
// Good luck!
|
|||
|
|
return true;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
euler58();
|
|||
|
|
|
|||
|
|
```
|
|||
|
|
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
|
|||
|
|
|
|||
|
|
</section>
|
|||
|
|
|
|||
|
|
## Solution
|
|||
|
|
<section id='solution'>
|
|||
|
|
|
|||
|
|
```js
|
|||
|
|
// solution required
|
|||
|
|
```
|
|||
|
|
</section>
|