Problem 365
A huge binomial coefficient

The binomial coeffient 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.

These problems are part of Project Euler and are licensed under CC BY-NC-SA 2.0 UK

http://projecteuler.net/problem=365