freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.chinese.md at 3b65bc8191721b3a7259d2daee4bd76e200af5aa

Files

Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220 )

* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions

2020-03-03 18:49:47 +05:30

910 B

Raw Blame History

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的总和是多少？

Instructions

Tests

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

Challenge Seed

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

euler146();

Solution

// solution required

910 B Raw Blame History Unescape Escape