Tuesday, March 6, 2018

elementary number theory - Proving that palpha+beta+1midnchoosekpkalpha when pbetamidn.

Let n,αN,βN0, and let p be odd prime number s.t. pβ|n.




How do we prove that p^{\alpha+\beta+1}|{n\choose k}p^{k\alpha} for every k\in\{1,2,\ldots,n-1\}?

No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f \colon A \rightarrow B and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...