freeCodeCamp/problem-326-modulo-summations.english.md at 91df817cfe8a0de2c895dc1e3a69ce2101c79e79

Files

Randell Dawson a7eb800450 fix(curriculum): Remove unnecessary assert message argument from English Coding Interview Prep challenges - Project Euler - 04 (#36418 )

* fix: removed assert msg argument-4

* fix: remove double quotes surrounding testString code

Co-Authored-By: Tom <20648924+moT01@users.noreply.github.com>

2019-07-27 07:34:19 -05:00

964 B

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f4b21000cf542c50ffc5	5	Problem 326: Modulo Summations

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

964 B Raw Blame History