Let p≥5 be a prime and let r be the number of ways of placing p checkers on a p×p checkerboard so that not all checkers are in the same row (but they may all be in the same column). Show that r is divisible by p5. Here, we assume that all the checkers are identical. number theorycombinatoricsAPMO