Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md
gikf a9418a1fe9 fix(curriculum): clean-up Project Euler 221-240 (#42839)
* fix: clean-up Project Euler 221-240

* fix: corrections from review

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
2021-07-15 14:26:34 +02:00

873 B
Raw Permalink Blame History

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f4531000cf542c50ff66 Problem 231: The prime factorisation of binomial coefficients 5 301875 problem-231-the-prime-factorisation-of-binomial-coefficients

--description--

The binomial coefficient \displaystyle\binom{10}{3} = 120.

120 = 2^3 × 3 × 5 = 2 × 2 × 2 × 3 × 5, and 2 + 2 + 2 + 3 + 5 = 14.

So the sum of the terms in the prime factorisation of \displaystyle\binom{10}{3} is 14.

Find the sum of the terms in the prime factorisation of \binom{20\\,000\\,000}{15\\,000\\,000}.

--hints--

primeFactorisation() should return 7526965179680.

assert.strictEqual(primeFactorisation(), 7526965179680);

--seed--

--seed-contents--

function primeFactorisation() {

  return true;
}

primeFactorisation();

--solutions--

// solution required