freeCodeCamp/problem-288-an-enormous-factorial.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

1.0 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f48d1000cf542c50ff9f	5	false	Problem 288: An enormous factorial	301939

Description

For any prime p the number N(p,q) is defined by N(p,q) = ∑n=0 to q Tn*pn with Tn generated by the following random number generator:

S0 = 290797 Sn+1 = Sn2 mod 50515093 Tn = Sn mod p

Let Nfac(p,q) be the factorial of N(p,q). Let NF(p,q) be the number of factors p in Nfac(p,q).

You are given that NF(3,10000) mod 320=624955285.

Find NF(61,107) mod 6110

Instructions

Tests

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

Challenge Seed

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

euler288();

Solution

// solution required

1.0 KiB Raw Blame History