Sunday, 22 June 2014

number theory - Why is nchoosek periodic modulo p with period pe?

Given some integer k, define the sequence a_n={n\choose k}. Claim: a_n is periodic modulo a prime p with the period being the least power p^e of p such that $k

In other words, a_{n+p^e}\equiv a_{n} (\text{mod } p). But the period p^e is smaller than I'd have expected (it is obvious that a period satisfying k! < p^e would work). So how can I prove that it works?

No comments:

Post a Comment

real analysis - How to find lim_{hrightarrow 0}frac{sin(ha)}{h}

How to find \lim_{h\rightarrow 0}\frac{\sin(ha)}{h} without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...