Problem 3
Let be a prime. Let be the number of ways of placing identical checkers on a checkerboard so that not all checkers are in the same row (they may all be in the same column). Show that is divisible by .
Step 5 of 5: Conclude divisibility
Detailed analysis
The product congruence says the parenthesized factor in is divisible by . The leading factor then gives , as required.