freeCodeCamp/problem-451-modular-inverses.english.md at 92377cf71af628cb5ea6b28ff7d6fa66a9b52449

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

1.2 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f5311000cf542c510042	5	false	Problem 451: Modular inverses	302124

Description

Consider the number 15. There are eight positive numbers less than 15 which are coprime to 15: 1, 2, 4, 7, 8, 11, 13, 14. The modular inverses of these numbers modulo 15 are: 1, 8, 4, 13, 2, 11, 7, 14 because 1*1 mod 15=1 2*8=16 mod 15=1 4*4=16 mod 15=1 7*13=91 mod 15=1 11*11=121 mod 15=1 14*14=196 mod 15=1

Let I(n) be the largest positive number m smaller than n-1 such that the modular inverse of m modulo n equals m itself. So I(15)=11. Also I(100)=51 and I(7)=1.

Find ∑I(n) for 3≤n≤2·107

Instructions

Tests

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

Challenge Seed

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

euler451();

Solution

// solution required

1.2 KiB Raw Blame History