freeCodeCamp/problem-326-modulo-summations.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

1001 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4b21000cf542c50ffc5	5	false	Problem 326: Modulo Summations	301983

Description

Let an be a sequence recursively defined by: .

So the first 10 elements of an are: 1,1,0,3,0,3,5,4,1,9.

Let f(N,M) represent the number of pairs (p,q) such that:

It can be seen that f(10,10)=4 with the pairs (3,3), (5,5), (7,9) and (9,10).

You are also given that f(104,103)=97158.

Find f(1012,106).

Instructions

Tests

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

Challenge Seed

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

euler326();

Solution

// solution required

1001 B Raw Blame History