<section id="description">
<p>The binomial coefficient C(1018,109) is a number with more than 9 billion (9×109) digits.</p><p>Let M(n,k,m) denote the binomial coefficient C(n,k) modulo m.</p>
<p>Calculate ∑M(1018,109,p_q_r) for 1000&#x3C;p&#x3C;q&#x3C;r&#x3C;5000 and p,q,r prime.</p>
</section>

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

euler365();


index

Problem 365: A huge binomial coefficient

<code>euler365()</code> should return 162619462356610300.