Euler in Babylon

A huge binomial coefficient

December 31, 2011

The binomial coefficient C(1018,109) is a number with more than 9 billion (9×109) digits.

Let M(n,k,m) denote the binomial coefficient C(n,k) modulo m.

Calculate ∑M(1018,109,p*q*r) for 1000<p<q<r<5000 and p,q,r prime.


gamwe6

Written by gamwe6 who lives and works in San Francisco building useful things. You should follow him on Twitter