MathDB
Problems
Contests
National and Regional Contests
PEN Problems
PEN O Problems
7
O 7
O 7
Source:
May 25, 2007
induction
number theory
least common multiple
Problem Statement
Show that for each
n
≥
2
n \ge 2
n
≥
2
, there is a set
S
S
S
of
n
n
n
integers such that
(
a
−
b
)
2
(a-b)^2
(
a
−
b
)
2
divides
a
b
ab
ab
for every distinct
a
,
b
∈
S
a, b\in S
a
,
b
∈
S
.
Back to Problems
View on AoPS