Tuesday 27 January 2015

Divisibility of a binomial coefficient by a prime

Let $q=p^r,$ where $p\in\mathbb{P}$ is a prime and $r\in\mathbb{N}\setminus\{0\}$ is a natural number (non-zero). How to prove that for each $i\in\{1,2,\ldots,q-1\}$ the binomial coefficient $\binom{q}{i}$ is divisible by $p$?




I find it easy to show that $p|\binom{p}{i},$ but here it's more complicated :/

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}...