Divisibility of binomial coefficient by prime power - Kummer's theorem

Solution 1:

I've noticed this, too. I believe that you're correct and that Granville's "equivalent statement of this theorem" is wrong.

As evidence, I give you two items: first, the counter-example you mentioned, and second, the published version of your linked article by Andrew Granville does not contain this line that "the power dividing $n\choose{m}$ is precisely the number of indicies $i$ for which $n_i < m_i$."

The published version is a bit hard to find, but here's a version on Google Books that I found by Googling "Andrew Granville Binomial Coefficients" from within Google Books. You'll noticed that this published version is an edited copy of the article on the Univ. of Montreal website.

When in doubt, look for the official version of the article. My guess is that the article on Andrew's Montral website is a slightly earlier, unedited version.

EDIT: I just got an e-mail from Andrew himself on this question, and he said, "You should believe the published version -- I do vaguely remember making such a a change. Thanks for pointing out the discrepancy."