Exercise 23, § 1

Let $n > 1$ be a rational integer; show that the gcd of the $n-1$ binomial coefficients $\binom{n}{k}$ ($1 \leq k \leq n-1$) is equal to 1 if n is divisible by two distinct prime numbers, and is equal to p if n is a power of the prime number p.