Files

41 lines
792 B
Markdown
Raw Permalink Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f3fe1000cf542c50ff11
title: '問題 146素數模式的研究'
challengeType: 5
forumTopicId: 301775
dashedName: problem-146-investigating-a-prime-pattern
---
# --description--
使得數字 $n^2 + 1$、$n^2 + 3$、$n^2 + 7$、$n^2 + 9$、$n^2 + 13$ 及 $n^2 + 27$ 爲連續素數的最小正整數 $n$ 是 10。 在小於一百萬的整數中,所有滿足該條件的整數 $n$ 之和爲 1242490。
請求出在小於一億五千萬的整數中,所有滿足該條件的整數 $n$ 之和是多少?
# --hints--
`primePattern()` 應該返回 `676333270`
```js
assert.strictEqual(primePattern(), 676333270);
```
# --seed--
## --seed-contents--
```js
function primePattern() {
return true;
}
primePattern();
```
# --solutions--
```js
// solution required
```