← Complete problem index

PROJECT EULER · #0365

A Huge Binomial Coefficient

Statement only · SolvedOriginal problem ↗

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

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

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

Write-up coming later

The complete problem is available here. An approach, code, and answer will be added later.