MathDB
n-x balls in x+1 boxes

Source: Spanish MO 2012 Q3

June 7, 2012
combinatorics proposedcombinatorics

Problem Statement

Let xx and nn be integers such that 1xn1\le x\le n. We have x+1x+1 separate boxes and nxn-x identical balls. Define f(n,x)f(n,x) as the number of ways that the nxn-x balls can be distributed into the x+1x+1 boxes. Let pp be a prime number. Find the integers nn greater than 11 such that the prime number pp is a divisor of f(n,x)f(n,x) for all x{1,2,,n1}x\in\{1,2,\ldots ,n-1\}.