MathDB
Problems
Contests
National and Regional Contests
Russia Contests
Saint Petersburg Mathematical Olympiad
2001 Saint Petersburg Mathematical Olympiad
10.6
10.6
Part of
2001 Saint Petersburg Mathematical Olympiad
Problems
(1)
Inequality with gcd
Source: St. Petersburg MO 2001, 10th grade P6
4/24/2023
For any positive integers
n
>
m
n>m
n
>
m
prove the following inequality:
[
m
,
n
]
+
[
m
+
1
,
n
+
1
]
≥
2
m
n
[m,n]+[m+1,n+1]\geq 2m\sqrt{n}
[
m
,
n
]
+
[
m
+
1
,
n
+
1
]
≥
2
m
n
As usual, [x,y] denotes the least common multiply of
x
,
y
x,y
x
,
y
[I]Proposed by A. Golovanov
inequalities
GCD
number theory
algebra
greatest common divisor
least common multiple