Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-322-binomial-coefficients-divisible-by-10.md
gikf 1af6e7aa5a fix(curriculum): clean-up Project Euler 321-340 (#42988)
* fix: clean-up Project Euler 321-340

* fix: typo

* fix: corrections from review

Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com>

* fix: corrections from review

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

Co-authored-by: Sem Bauke <46919888+Sembauke@users.noreply.github.com>
Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
2021-07-29 11:59:06 -07:00

847 B

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f4af1000cf542c50ffc1 Problem 322: Binomial coefficients divisible by 10 5 301979 problem-322-binomial-coefficients-divisible-by-10

--description--

Let T(m, n) be the number of the binomial coefficients {}^iC_n that are divisible by 10 for n ≤ i &lt; m (i, m and n are positive integers).

You are given that T({10}^9, {10}^7 - 10) = 989\\,697\\,000.

Find T({10}^{18}, {10}^{12} - 10).

--hints--

binomialCoefficientsDivisibleBy10() should return 999998760323314000.

assert.strictEqual(binomialCoefficientsDivisibleBy10(), 999998760323314000);

--seed--

--seed-contents--

function binomialCoefficientsDivisibleBy10() {

  return true;
}

binomialCoefficientsDivisibleBy10();

--solutions--

// solution required