Let us denote by(n,k) the standard combination (select k elements from a set of n).
Show that if
(n,1)=(n,2)=...=(n,n-1)=0 (mod p),
then
n=p^t
(a non-zero power of a prime number p).