Tuesday, 27 January 2015

Divisibility of a binomial coefficient by a prime

Let q=pr, where pP is a prime and rN{0} is a natural number (non-zero). How to prove that for each i{1,2,,q1} the binomial coefficient (qi) is divisible by p?




I find it easy to show that p|(pi), but here it's more complicated :/

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...