I hope some of you can help in this.
Actually my problem is I need to solve the following problem.
(1 + x)^m (mod n, x^r-a)
i.e. mod the coefficient with 'n' and the polynomial with x^r-a
I should be able to tell the coefficient of some x^i, i is any
m,n,a are 30 digits long. Quite big I guess
So, if I try to solve it, first I jump into binomial Coefficient, How
do I solve the binomial coeffiecient for such big numbers,. Lets say I
need to solve
465465464665464646!/245425545533453! I hope you understand what it
is.. that is a big number's factorial divided by another big numbre
factorial.. Humongous task . isnt it..
I am sure there should be a way around to solve this problem.. Do you
guys have any idea, how to solve this division.. I am not supposed to
use any packages. I am supposed to write my own program.. so please
tell me an algorithm, or any sample code..