Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

$n\ge k $
$ m>0$

How to find? $$\binom{n}{k}\mod m$$ without counting $n,k!$

share|cite|improve this question
What are your thoughts so far? – Mike Spivey Jan 15 '13 at 22:15
This question helps, when $p$ is a prime. A certain well known method then helps, if $m$ is square-free... – Jyrki Lahtonen Jan 15 '13 at 22:23
My friend published an undergraduate paper that contains some results that might interest you. :) – Haskell Curry Jan 15 '13 at 22:59
This is too complicated for me. I thought that it will be easier. I needed it to use in program written in C. – aiki93 Jan 15 '13 at 23:11
If it's a programming question, you should post it to the programming website, not here. – Gerry Myerson Jan 15 '13 at 23:45

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.