MathDB
Problems
Contests
International Contests
Pan-African Shortlist
2017 Pan-African Shortlist
N1
N1
Part of
2017 Pan-African Shortlist
Problems
(1)
A 28
Source:
5/25/2007
Prove that the expression
gcd
(
m
,
n
)
n
(
n
m
)
\frac{\gcd(m, n)}{n}{n \choose m}
n
g
cd
(
m
,
n
)
(
m
n
)
is an integer for all pairs of positive integers
(
m
,
n
)
(m, n)
(
m
,
n
)
with
n
≥
m
≥
1
n \ge m \ge 1
n
≥
m
≥
1
.
number theory
greatest common divisor
floor function
function
algebra
Divisibility Theory