freeCodeCamp/problem-146-investigating-a-prime-pattern.chinese.md at b99d78858be1d1ab1aae3417e00c38a458a72ae3

Files

Oliver Eyton-Williams 61460c8601 fix: insert blank line after ```

search and replace ```\n< with ```\n\n< to ensure there's an empty line
before closing tags

2020-08-16 04:45:20 +05:30

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3fe1000cf542c50ff11	5	Problem 146: Investigating a Prime Pattern		问题146：调查素数模式

Description

整数n2 + 1，n2 + 3，n2 + 7，n2 + 9，n2 + 13和n2 + 27为其连续质数的最小正整数n为10。所有小于100万的整数n的总和是1242490。

所有小于1.5亿的整数n的总和是多少？

tests:
  - text: <code>euler146()</code>应该返回676333270。
    testString: assert.strictEqual(euler146(), 676333270);

function euler146() {
  // Good luck!
  return true;
}

euler146();

// solution required

/section>