- #1
coolul007
Gold Member
- 271
- 8
I am trying to predict the modulus without really doing the expansion. Therefore I'm in a snag with actually computing vs. only computing what I think I need. Here's the assumption I am Making:
n C r == 0 mod (n-1) for all r > 1
n C r are the coefficients of the binomial expansion. My assumption is that all the middle terms are zero and that only the:
x^n + nx^(n-1) + 0 +... +0 + nx +1 need to be computed mod(n-1)
My theoretical results are conflicting with the actual.
n C r == 0 mod (n-1) for all r > 1
n C r are the coefficients of the binomial expansion. My assumption is that all the middle terms are zero and that only the:
x^n + nx^(n-1) + 0 +... +0 + nx +1 need to be computed mod(n-1)
My theoretical results are conflicting with the actual.
Last edited: