$n\ge k $
$ m>0$
How to find? $$\binom{n}{k}\mod m$$ without counting $n,k!$
Asked
Active
Viewed 325 times
1
-
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
-
See this related question: http://math.stackexchange.com/questions/11002/cn-p-even-or-odd – vadim123 Apr 19 '13 at 14:04