MathDB
Problems
Contests
International Contests
Caucasus Mathematical Olympiad
2023 Caucasus Mathematical Olympiad
2023 Caucasus Mathematical Olympiad
Part of
Caucasus Mathematical Olympiad
Subcontests
(8)
7
2
Hide problems
Sasha has $10$ cards with numbers $1, 2, 4, 8,\ldots, 512$
Sasha has
10
10
10
cards with numbers
1
,
2
,
4
,
8
,
…
,
512
1, 2, 4, 8,\ldots, 512
1
,
2
,
4
,
8
,
…
,
512
. He writes the number
0
0
0
on the board and invites Dima to play a game. Dima tells the integer
0
<
p
<
10
,
p
0 < p < 10, p
0
<
p
<
10
,
p
can vary from round to round. Sasha chooses
p
p
p
cards before which he puts a “
+
+
+
” sign, and before the other cards he puts a “
−
-
−
" sign. The obtained number is calculated and added to the number on the board. Find the greatest absolute value of the number on the board Dima can get on the board after several rounds regardless Sasha’s moves.
Find all $n$ such that after $n-1$ moves it is possible to obtain $0$.
Numbers
1
,
2
,
…
,
n
1, 2,\ldots, n
1
,
2
,
…
,
n
are written on the board. By one move, we replace some two numbers
a
,
b
a, b
a
,
b
with the number
a
2
−
b
a^2-b{}
a
2
−
b
. Find all
n
n{}
n
such that after
n
−
1
n-1
n
−
1
moves it is possible to obtain
0
0
0
.
6
2
Hide problems
\gcd(a, b) + lcm(a, b) = \gcd(a, c) + lcm(a, c)
Let
a
,
b
,
c
a, b, c
a
,
b
,
c
be positive integers such that
gcd
(
a
,
b
)
+
lcm
(
a
,
b
)
=
gcd
(
a
,
c
)
+
lcm
(
a
,
c
)
.
\gcd(a, b) + \text{lcm}(a, b) = \gcd(a, c) + \text{lcm}(a, c).
g
cd
(
a
,
b
)
+
lcm
(
a
,
b
)
=
g
cd
(
a
,
c
)
+
lcm
(
a
,
c
)
.
Does it follow from this that
b
=
c
b = c
b
=
c
?
Find the greatest $n$
Let
n
≤
100
n \leq 100
n
≤
100
be an integer. Hare puts real numbers in the cells of a
100
×
100
100 \times 100
100
×
100
table. By asking Hare one question, Wolf can find out the sum of all numbers of a square
n
×
n
n \times n
n
×
n
, or the sum of all numbers of a rectangle
1
×
(
n
−
1
)
1 \times (n - 1)
1
×
(
n
−
1
)
(or
(
n
−
1
)
×
1
(n - 1) \times 1
(
n
−
1
)
×
1
). Find the greatest
n
n{}
n
such that, after several questions, Wolf can find the numbers in all cells, with guarantee.
5
1
Hide problems
ne can find a rectangle $1\times k$ in which the sum of the numbers equals $0$
Is it possible to fill a table
1
×
n
1\times n
1
×
n
with pairwise distinct integers such that for any
k
=
1
,
2
,
…
,
n
k = 1, 2,\ldots, n
k
=
1
,
2
,
…
,
n
one can find a rectangle
1
×
k
1\times k
1
×
k
in which the sum of the numbers equals
0
0
0
if a)
n
=
11
n= 11
n
=
11
; b)
n
=
12
n= 12
n
=
12
?
3
1
Hide problems
The numbers $1, 2, 3,\ldots, 2\underbrace{00\ldots0}_{100 \text{ zeroes}}2$ are
The numbers
1
,
2
,
3
,
…
,
2
00
…
0
⏟
100
zeroes
2
1, 2, 3,\ldots, 2\underbrace{00\ldots0}_{100 \text{ zeroes}}2
1
,
2
,
3
,
…
,
2
100
zeroes
00
…
0
2
are written on the board. Is it possible to paint half of them red and remaining ones blue, so that the sum of red numbers is divisible by the sum of blue ones?
2
1
Hide problems
Prove that this hexagon can be covered by a triangle with perimeter at most $3$.
In a convex hexagon the value of each angle is
12
0
∘
120^{\circ}
12
0
∘
. The perimeter of the hexagon equals
2
2
2
. Prove that this hexagon can be covered by a triangle with perimeter at most
3
3
3
.
1
2
Hide problems
the product of any $n$ odd consecutive positive integers is divisible by $45$.
Determine the least positive integer
n
n{}
n
for which the following statement is true: the product of any
n
n{}
n
odd consecutive positive integers is divisible by
45
45
45
.
Prove that if $q+q^{'} =r +r^{'}$, then $2n$ is a perfect square.
Let
n
n{}
n
and
m
m
m
be positive integers,
n
>
m
>
1
n>m>1
n
>
m
>
1
. Let
n
n{}
n
divided by
m
m
m
have partial quotient
q
q
q
and remainder
r
r
r
(so that
n
=
q
m
+
r
n = qm + r
n
=
q
m
+
r
, where
r
∈
{
0
,
1
,
.
.
.
,
m
−
1
}
r\in\{0,1,...,m-1\}
r
∈
{
0
,
1
,
...
,
m
−
1
}
). Let
n
−
1
n-1
n
−
1
divided by
m
m
m
have partial quotient
q
′
q^{'}
q
′
and remainder
r
′
r^{'}
r
′
. a) It appears that
q
+
q
′
=
r
+
r
′
=
99
q+q^{'} =r +r^{'} = 99
q
+
q
′
=
r
+
r
′
=
99
. Find all possible values of
n
n{}
n
. b) Prove that if
q
+
q
′
=
r
+
r
′
q+q^{'} =r +r^{'}
q
+
q
′
=
r
+
r
′
, then
2
n
2n
2
n
is a perfect square.
8
2
Hide problems
Prove that the triangle $A^{'}B^{'}C^{'}$ is equilateral.
Let
A
B
C
ABC
A
BC
be an equilateral triangle with the side length equals
a
+
b
+
c
a+ b+ c
a
+
b
+
c
. On the side
A
B
AB{}
A
B
of the triangle
A
B
C
ABC
A
BC
points
C
1
C_1
C
1
and
C
2
C_2
C
2
are chosen, on the side
B
C
BC
BC
points
A
1
A_1
A
1
and
A
2
A_2
A
2
, arc chosen, and on the side
C
A
CA
C
A
points
B
1
B_1
B
1
and
B
2
B_2
B
2
are chosen such that
A
1
A
2
=
C
B
1
=
B
C
2
=
a
,
B
1
B
2
=
A
C
1
=
C
A
2
=
b
,
C
1
C
2
=
B
A
1
=
A
B
2
=
c
A_1A_2 = CB_1 = BC_2 = a, B_1B_2 = AC_1 = CA_2 = b, C_1C_2 = BA_1 = AB_2 = c
A
1
A
2
=
C
B
1
=
B
C
2
=
a
,
B
1
B
2
=
A
C
1
=
C
A
2
=
b
,
C
1
C
2
=
B
A
1
=
A
B
2
=
c
. Let the point
A
’
A^{’}
A
’
be such that the triangle
A
′
B
2
C
1
A^{'} B_2C_1
A
′
B
2
C
1
is equilateral, and the points
A
A
A
and
A
′
A^{'}
A
′
lie on different sides of the line
B
2
C
1
B_2C_1
B
2
C
1
. Similarly, the points
B
’
B^{’}
B
’
and
C
′
C^{'}
C
′
are constructed (the triangle
B
′
C
2
A
1
B^{'} C_2A_1
B
′
C
2
A
1
is equilateral, and the points
B
B
B
and
B
’
B^{’}
B
’
lie on different sides of the line
C
2
A
1
C_2A_1
C
2
A
1
; the triangle
C
′
A
2
B
1
C^{'} A_2B_1
C
′
A
2
B
1
is equilateral, and the points
C
C
C
and
C
′
C^{'}
C
′
lie on different sides of the line
A
2
B
1
A_2B_1
A
2
B
1
). Prove that the triangle
A
′
B
′
C
′
A^{'}B^{'}C^{'}
A
′
B
′
C
′
is equilateral.
Cute geometry
Let
A
B
C
ABC
A
BC
be an acute-angled triangle, and let
A
A
1
,
B
B
1
,
C
C
1
AA_1, BB_1, CC_1
A
A
1
,
B
B
1
,
C
C
1
be its altitudes. Points
A
′
,
B
′
,
C
′
A', B', C'
A
′
,
B
′
,
C
′
are chosen on the segments
A
A
1
,
B
B
1
,
C
C
1
AA_1, BB_1, CC_1
A
A
1
,
B
B
1
,
C
C
1
, respectively, so that
∠
B
A
′
C
=
∠
A
C
′
B
=
∠
C
B
′
A
=
9
0
o
\angle BA'C = \angle AC'B = \angle CB'A = 90^{o}
∠
B
A
′
C
=
∠
A
C
′
B
=
∠
C
B
′
A
=
9
0
o
. Let segments
A
C
′
AC'
A
C
′
and
C
A
′
CA'
C
A
′
intersect at
B
"
B"
B
"
; points
A
"
,
C
"
A", C"
A
"
,
C
"
are defined similarly. Prove that hexagon
A
′
B
"
C
′
A
"
B
′
C
"
A'B"C'A"B'C"
A
′
B
"
C
′
A
"
B
′
C
"
is circumscribed.
4
1
Hide problems
Russian graph with minimal number of edges satisfying a specific condition
Let
n
>
k
>
1
n>k>1
n
>
k
>
1
be positive integers and let
G
G
G
be a graph with
n
n
n
vertices such that among any
k
k
k
vertices, there is a vertex connected to the rest
k
−
1
k-1
k
−
1
vertices. Find the minimal possible number of edges of
G
G
G
.Proposed by V. Dolnikov