Skip to main content
OlympiadHQ

Browse · MathNet

Print

Asia Pacific Mathematics Olympiad (APMO)

counting and probability

Problem

Let be a prime and let be the number of ways of placing checkers on a checkerboard so that not all checkers are in the same row (but they may all be in the same column). Show that is divisible by . Here, we assume that all the checkers are identical.
Solution
Note that . Hence, it suffices to show that Now, let Then the congruence equation (1) is the same as . Therefore, it suffices to show that or .

Since for all , we can factor Comparing the coefficients of the left hand side with those of the right hand side, we obtain for all and . On the other hand, plugging for in the expansion, we get which implies Since , and hence as desired.

Techniques

Algebraic properties of binomial coefficientsFermat / Euler / Wilson theoremsSymmetric functionsPolynomial operations