freeCodeCamp/problem-123-prime-square-remainders.english.md at 908adc2c372f2c1af0c8d1c80b264c23f96fd7d7

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

995 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f3e71000cf542c50fefa	5	false	Problem 123: Prime square remainders	301750

Description

Let pn be the nth prime: 2, 3, 5, 7, 11, ..., and let r be the remainder when (pn−1)n + (pn+1)n is divided by pn2. For example, when n = 3, p3 = 5, and 43 + 63 = 280 ≡ 5 mod 25. The least value of n for which the remainder first exceeds 109 is 7037. Find the least value of n for which the remainder first exceeds 1010.

Instructions

Tests

tests:
  - text: <code>euler123()</code> should return 21035.
    testString: assert.strictEqual(euler123(), 21035);

Challenge Seed

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

euler123();

Solution

// solution required

995 B Raw Blame History Unescape Escape