Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.md

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
```