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.
Use Cmd instead of Ctrl if you're on a Mac.
| g | Focus editor |
| Ctrl-Enter | Run the test with current code |
| Ctrl-Shift-K | Reset the editor |
| Ctrl-Shift-L | Clear console output |
| Ctrl-Shift-X | Show the solution |
| [ | Previous challenge |
| ] | Next challenge |
| T | Back to top page |
| ? | Show this dialog |
| ESC | Hide this dialog |
| Shift-ESC | Blur focus from editor |