MathDB
Problems
Contests
Undergraduate contests
Miklós Schweitzer
1949 Miklós Schweitzer
6
6
Part of
1949 Miklós Schweitzer
Problems
(1)
Miklos Schweitzer 1949_6
Source:
10/2/2008
Let
n
n
n
and
k
k
k
be positive integers,
n
≥
k
n\geq k
n
≥
k
. Prove that the greatest common divisor of the numbers \binom{n}{k},\binom{n\plus{}1}{k},\ldots,\binom{n\plus{}k}{k} is
1
1
1
.
number theory
greatest common divisor
number theory proposed