Y by Adventure10
Let
and
be integers with
. For a positive integer
, let
be the least common multiple of
.
Prove that
is a divisor of
for all
. [Here,
denotes a binomial coefficient. Note that
if
.]






Prove that

![$L_i \cdot [\binom{m}{i} - \binom{m-k}{i}]$](http://latex.artofproblemsolving.com/9/f/3/9f39bfc257d726b7c009aeb2e17bc8a2c1bfad08.png)




We have your learning goals covered with Spring and Summer courses available. Enroll today!
Something appears to not have loaded correctly.