freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-123-prime-square-remainders.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f3e71000cf542c50fefa	5	Problem 123: Prime square remainders		问题123：素数正方形余数

Description

令pn为第n个素数：2,3,5,7,11 ......，并且当r（pn-1）n +（pn + 1）n除以pn2时，令r为余数。例如，当n = 3时，p3 = 5，并且43 + 63 =280≡5mod 25.余数首先超过109的n的最小值是7037.求出余数首次超过的n的最小值1010。

Instructions

Tests

tests:
  - text: <code>euler123()</code>应该返回21035。
    testString: 'assert.strictEqual(euler123(), 21035, "<code>euler123()</code> should return 21035.");'

Challenge Seed

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

euler123();

Solution

// solution required