MathDB
Problems
Contests
National and Regional Contests
Ukraine Contests
Official Ukraine Selection Cycle
Ukraine National Mathematical Olympiad
2023 Ukraine National Mathematical Olympiad
2023 Ukraine National Mathematical Olympiad
Part of
Ukraine National Mathematical Olympiad
Subcontests
(30)
11.8
1
Hide problems
Minimum Size of Largest Connected Component in $3$-Colored Complete Graph
There are
2024
2024
2024
cities in a country, every two of which are bidirectionally connected by exactly one of three modes of transportation - rail, air, or road. A tourist has arrived in this country and has the entire transportation scheme. He chooses a travel ticket for one of the modes of transportation and the city from which he starts his trip. He wants to visit as many cities as possible, but using only the ticket for the specified type of transportation. What is the largest
k
k
k
for which the tourist will always be able to visit at least
k
k
k
cities? During the route, he can return to the cities he has already visited.Proposed by Bogdan Rublov
11.7
1
Hide problems
Number Theory Is Blessed by This Problem of Author of Imo 2021 P3
For a positive integer
n
n
n
consider all its divisors
1
=
d
1
<
d
2
<
…
<
d
k
=
n
1 = d_1 < d_2 < \ldots < d_k = n
1
=
d
1
<
d
2
<
…
<
d
k
=
n
. For
2
≤
i
≤
k
−
1
2 \le i \le k-1
2
≤
i
≤
k
−
1
, let's call divisor
d
i
d_i
d
i
good, if
d
i
−
1
d
i
+
1
d_{i-1}d_{i+1}
d
i
−
1
d
i
+
1
isn't divisible by
d
i
d_i
d
i
. Find all
n
n
n
, such that the number of their good divisors is smaller than the number of their prime distinct divisors.Proposed by Mykhailo Shtandenko
11.5
1
Hide problems
Is Product of Mixed Polynomials Always Mixed?
Let's call a polynomial mixed if it has both positive and negative coefficients (
0
0
0
isn't considered positive or negative). Is the product of two mixed polynomials always mixed?Proposed by Vadym Koval
10.8
1
Hide problems
On the Number of Distinct Colors in Perfect Matchings
Consider a complete graph on
4046
4046
4046
nodes, whose edges are colored in some colors. Let's call this graph
k
k
k
-good if we can split all its nodes into
2023
2023
2023
pairs so that there are exactly
k
k
k
distinct colors among the colors of
2023
2023
2023
edges that connect the nodes from the same pairs. Is it possible that the graph is
999
999
999
-good and
1001
1001
1001
-good but not
1000
1000
1000
-good?Proposed by Anton Trygub
10.7
1
Hide problems
Powers of Two and Differences
You are given
n
≥
2
n \ge 2
n
≥
2
distinct positive integers. For every pair
a
<
b
a<b
a
<
b
of them, Vlada writes on the board the largest power of
2
2
2
that divides
b
−
a
b-a
b
−
a
. At most how many distinct powers of
2
2
2
could Vlada have written? Proposed by Oleksiy Masalitin
10.6
1
Hide problems
Maximum Absolute Values of Coefficients of Polynomials
Let
P
(
x
)
,
Q
(
x
)
,
R
(
x
)
P(x), Q(x), R(x)
P
(
x
)
,
Q
(
x
)
,
R
(
x
)
be polynomials with integer coefficients, such that
P
(
x
)
=
Q
(
x
)
R
(
x
)
P(x) = Q(x)R(x)
P
(
x
)
=
Q
(
x
)
R
(
x
)
. Let's denote by
a
a
a
and
b
b
b
the largest absolute values of coefficients of
P
,
Q
P, Q
P
,
Q
correspondingly. Does
b
≤
2023
a
b \le 2023a
b
≤
2023
a
always hold? Proposed by Dmytro Petrovsky
9.8
1
Hide problems
Maximum Number of Edges in a Graph With Unique Matching
What is the largest possible number of edges in a graph on
2
n
2n
2
n
nodes, if there exists exactly one way to split its nodes into
n
n
n
pairs so that the nodes from each pair are connected by an edge?Proposed by Anton Trygub
9.7
1
Hide problems
Powers of Two and Sums
You are given
n
≥
2
n \ge 2
n
≥
2
distinct positive integers. Let's call a pair of these integers elegant if their sum is an integer power of
2
2
2
. For every
n
n
n
find the largest possible number of elegant pairs.Proposed by Oleksiy Masalitin
8.8
1
Hide problems
Split Into Groups With Different Remainders of Sums
You are given a set of
m
m
m
integers, all of which give distinct remainders modulo some integer
n
n
n
. Show that for any integer
k
≤
m
k \le m
k
≤
m
you can split this set into
k
k
k
nonempty groups so that the sums of elements in these groups are distinct modulo
n
n
n
.Proposed by Anton Trygub
8.7
1
Hide problems
Closing Airports (This Problem Was Made During COVID)
The country has
n
≥
3
n \ge 3
n
≥
3
airports, some pairs of which are connected by bidirectional flights. Every day, the government closes the airport with the strictly highest number of flights going out of it. What is the maximum number of days this can continue?Proposed by Fedir Yudin
8.6
1
Hide problems
It's Hard to Make Easy Geometry for 8th Grade
In a convex pentagon
A
B
C
D
E
ABCDE
A
BC
D
E
the following conditions hold :
A
B
∥
C
D
AB \parallel CD
A
B
∥
C
D
,
B
C
∥
D
E
BC \parallel DE
BC
∥
D
E
, and
∠
B
A
E
=
∠
A
E
D
\angle BAE = \angle AED
∠
B
A
E
=
∠
A
E
D
. Prove that
A
B
+
B
C
=
C
D
+
D
E
AB + BC = CD + DE
A
B
+
BC
=
C
D
+
D
E
Proposed by Anton Trygub
8.5
1
Hide problems
Every Number Equal to the Square of the Sum of Remaining Numbers
Do there exist
10
10
10
real numbers, not all of which are equal, each of which is equal to the square of the sum of the remaining
9
9
9
numbers?Proposed by Bogdan Rublov
9.6
1
Hide problems
Angle condition again
A point
O
O
O
lies inside
△
A
B
C
\triangle ABC
△
A
BC
so that
∠
B
O
C
=
90
−
∠
B
A
C
\angle BOC=90-\angle BAC
∠
BOC
=
90
−
∠
B
A
C
. Let
B
O
,
C
O
BO, CO
BO
,
CO
meet
A
C
,
A
B
AC, AB
A
C
,
A
B
at
K
,
L
K, L
K
,
L
. Points
K
1
,
L
1
K_1, L_1
K
1
,
L
1
lie on the segments
C
L
,
B
K
CL, BK
C
L
,
B
K
so that
K
1
B
=
K
1
K
K_1B=K_1K
K
1
B
=
K
1
K
and
L
1
C
=
L
1
L
L_1C=L_1L
L
1
C
=
L
1
L
. If
M
M
M
is the midpoint of
B
C
BC
BC
, then prove that
∠
K
1
M
L
1
=
9
0
o
\angle K_1ML_1=90^{o}
∠
K
1
M
L
1
=
9
0
o
.Proposed by Anton Trygub
11.6
1
Hide problems
Weird angle conditions geo!
Let
K
K
K
be the midpoint of the median
A
M
AM
A
M
of a triangle
A
B
C
ABC
A
BC
. Points
X
,
Y
X, Y
X
,
Y
lie on
A
B
,
A
C
AB, AC
A
B
,
A
C
, respectively, such that
∠
K
X
M
=
∠
A
C
B
\angle KXM =\angle ACB
∠
K
XM
=
∠
A
CB
,
A
X
>
B
X
AX>BX
A
X
>
BX
and similarly
∠
K
Y
M
=
∠
A
B
C
\angle KYM =\angle ABC
∠
K
Y
M
=
∠
A
BC
,
A
Y
>
C
Y
AY>CY
A
Y
>
C
Y
. Prove that
B
,
C
,
X
,
Y
B, C, X, Y
B
,
C
,
X
,
Y
are concyclic.Proposed by Mykhailo Shtandenko
11.4
1
Hide problems
Functional Equation From FE Lord Vadym Koval
Find all functions
f
:
R
→
R
f : \mathbb{R} \to \mathbb{R}
f
:
R
→
R
, such that for any real
x
,
y
x, y
x
,
y
holds the following:
f
(
x
+
y
f
(
x
+
y
)
)
=
f
(
y
2
)
+
x
f
(
y
)
+
f
(
x
)
f(x+yf(x+y)) = f(y^2) + xf(y) + f(x)
f
(
x
+
y
f
(
x
+
y
))
=
f
(
y
2
)
+
x
f
(
y
)
+
f
(
x
)
Proposed by Vadym Koval
11.3
1
Hide problems
Show Tangency of Circles
In the quadrilateral
A
B
C
D
ABCD
A
BC
D
∠
A
B
C
=
∠
C
D
A
=
9
0
∘
\angle ABC = \angle CDA = 90^\circ
∠
A
BC
=
∠
C
D
A
=
9
0
∘
. Let
P
=
A
C
∩
B
D
P = AC \cap BD
P
=
A
C
∩
B
D
,
Q
=
A
B
∩
C
D
Q = AB\cap CD
Q
=
A
B
∩
C
D
,
R
=
A
D
∩
B
C
R = AD \cap BC
R
=
A
D
∩
BC
. Let
ℓ
\ell
ℓ
be the midline of the triangle
P
Q
R
PQR
PQR
, parallel to
Q
R
QR
QR
. Show that the circumcircle of the triangle formed by lines
A
B
,
A
D
,
ℓ
AB, AD, \ell
A
B
,
A
D
,
ℓ
is tangent to the circumcircle of the triangle formed by lines
C
D
,
C
B
,
ℓ
CD, CB, \ell
C
D
,
CB
,
ℓ
.Proposed by Fedir Yudin
11.2
1
Hide problems
Many Right Angles
Points
A
1
,
A
2
,
…
,
A
2022
A_1, A_2, \ldots, A_{2022}
A
1
,
A
2
,
…
,
A
2022
are chosen on a plane so that no three of them are collinear. Consider all angles
A
i
A
j
A
k
A_iA_jA_k
A
i
A
j
A
k
for distinct points
A
i
,
A
j
,
A
k
A_i, A_j, A_k
A
i
,
A
j
,
A
k
. What largest possible number of these angles can be equal to
9
0
∘
90^\circ
9
0
∘
?Proposed by Anton Trygub
11.1
1
Hide problems
Set With a^2+1 Divisible by b
Set
M
M
M
contains
n
≥
2
n \ge 2
n
≥
2
positive integers. It's known that for any two different
a
,
b
∈
M
a, b \in M
a
,
b
∈
M
,
a
2
+
1
a^2+1
a
2
+
1
is divisible by
b
b
b
. What is the largest possible value of
n
n
n
?Proposed by Oleksiy Masalitin
10.4
1
Hide problems
Even Algebra Can Be Cute
Let
(
x
n
)
(x_n)
(
x
n
)
be an infinite sequence of real numbers from interval
(
0
,
1
)
(0, 1)
(
0
,
1
)
. An infinite sequence
(
a
n
)
(a_n)
(
a
n
)
of positive integers is defined as follows:
a
1
=
1
a_1 = 1
a
1
=
1
, and for
i
≥
1
i \ge 1
i
≥
1
,
a
i
+
1
a_{i+1}
a
i
+
1
is equal to the smallest positive integer
m
m
m
, for which
[
x
1
+
x
2
+
…
+
x
m
]
=
a
i
[x_1 + x_2 + \ldots + x_m] = a_i
[
x
1
+
x
2
+
…
+
x
m
]
=
a
i
. Show that for any indexes
i
,
j
i, j
i
,
j
holds
a
i
+
j
≥
a
i
+
a
j
a_{i+j} \ge a_i + a_j
a
i
+
j
≥
a
i
+
a
j
.Proposed by Nazar Serdyuk
10.3
1
Hide problems
Return of Geometry Prodigy
Let
I
I
I
be the incenter of the triangle
A
B
C
ABC
A
BC
, and
P
P
P
be any point on the arc
B
A
C
BAC
B
A
C
of its circumcircle. Points
K
K
K
and
L
L
L
are chosen on the tangent to the circumcircle
ω
\omega
ω
of triangle
A
P
I
API
A
P
I
at point
I
I
I
, so that
B
K
=
K
I
BK = KI
B
K
=
K
I
and
C
L
=
L
I
CL = LI
C
L
=
L
I
. Show that the circumcircle of triangle
P
K
L
PKL
P
K
L
is tangent to
ω
\omega
ω
.Proposed by Mykhailo Shtandenko
10.2
1
Hide problems
Connected Coloring
On a rectangular board
100
×
300
100 \times 300
100
×
300
, two people take turns coloring the cells that have not yet been colored. The first one colors cells in yellow, and the second one in blue. Coloring is completed when every cell of the board is colored. A connected sequence of cells is a sequence of cells in which every two consecutive cells share a common side (and all cells in the sequence are different). Consider all possible connected sequences of yellow cells. The result of the first player is the number of cells in the connected sequence of yellow cells of maximum length. The first player's goal is to maximize the result, and the second player's goal is to make the first player's result as small as possible. Prove that if each player tries to achieve his goal, the result of the first player will be no more than
200
200
200
.Proposed by Mykhailo Shtandenko and Fedir Yudin
10.1
1
Hide problems
Product of K Integers Ends With K
Find all positive integers
k
k
k
, for which the product of some consecutive
k
k
k
positive integers ends with
k
k
k
. Proposed by Oleksiy Masalitin
9.4
1
Hide problems
Fractional Parts of Square Roots, Continued
Find the smallest real number
C
C
C
, such that for any positive integers
x
≠
y
x \neq y
x
=
y
holds the following:
min
(
{
x
2
+
2
y
}
,
{
y
2
+
2
x
}
)
<
C
\min(\{\sqrt{x^2 + 2y}\}, \{\sqrt{y^2 + 2x}\})<C
min
({
x
2
+
2
y
}
,
{
y
2
+
2
x
})
<
C
Here
{
x
}
\{x\}
{
x
}
denotes the fractional part of
x
x
x
. For example,
{
3.14
}
=
0.14
\{3.14\} = 0.14
{
3.14
}
=
0.14
.Proposed by Anton Trygub
9.3
1
Hide problems
4 Right Angles
You are given an acute triangle
A
B
C
ABC
A
BC
with circumcircle
ω
\omega
ω
. Points
F
F
F
on
A
C
AC
A
C
,
E
E
E
on
A
B
AB
A
B
and
P
,
Q
P, Q
P
,
Q
on
ω
\omega
ω
are chosen so that
∠
A
F
B
=
∠
A
E
C
=
∠
A
P
E
=
∠
A
Q
F
=
9
0
∘
\angle AFB = \angle AEC = \angle APE = \angle AQF = 90^\circ
∠
A
FB
=
∠
A
EC
=
∠
A
PE
=
∠
A
QF
=
9
0
∘
. Show that lines
B
C
,
E
F
,
P
Q
BC, EF, PQ
BC
,
EF
,
PQ
are concurrent or parallel.Proposed by Fedir Yudin
9.2
1
Hide problems
Numbers on the Circles Revisited
Positive integers
a
1
,
a
2
,
…
,
a
101
a_1, a_2, \ldots, a_{101}
a
1
,
a
2
,
…
,
a
101
are such that
a
i
+
1
a_i+1
a
i
+
1
is divisible by
a
i
+
1
a_{i+1}
a
i
+
1
for all
1
≤
i
≤
101
1 \le i \le 101
1
≤
i
≤
101
, where
a
102
=
a
1
a_{102} = a_1
a
102
=
a
1
. What is the largest possible value of
max
(
a
1
,
a
2
,
…
,
a
101
)
\max(a_1, a_2, \ldots, a_{101})
max
(
a
1
,
a
2
,
…
,
a
101
)
?Proposed by Oleksiy Masalitin
9.1
1
Hide problems
Are Numbers on the Circle Always Equal
n
≥
4
n \ge 4
n
≥
4
real numbers are arranged in a circle. It turned out that for any four consecutive numbers
a
,
b
,
c
,
d
a, b, c, d
a
,
b
,
c
,
d
, that lie on the circle in this order, holds
a
+
d
=
b
+
c
a+d = b+c
a
+
d
=
b
+
c
. For which
n
n
n
does it follow that all numbers on the circle are equal?Proposed by Oleksiy Masalitin
8.4
1
Hide problems
Point Equidistant From Diagonals of a Rhombus
Point
T
T
T
is chosen in the plane of a rhombus
A
B
C
D
ABCD
A
BC
D
so that
∠
A
T
C
+
∠
B
T
D
=
18
0
∘
\angle ATC + \angle BTD = 180^\circ
∠
A
TC
+
∠
BT
D
=
18
0
∘
, and circumcircles of triangles
A
T
C
ATC
A
TC
and
B
T
D
BTD
BT
D
are tangent to each other. Show that
T
T
T
is equidistant from diagonals of
A
B
C
D
ABCD
A
BC
D
.Proposed by Fedir Yudin
8.3
1
Hide problems
On Fractional Parts of Square Roots
Positive integers
x
,
y
x, y
x
,
y
satisfy the following conditions:
{
x
2
+
2
y
}
>
2
3
;
{
y
2
+
2
x
}
>
2
3
\{\sqrt{x^2 + 2y}\}> \frac{2}{3}; \hspace{10mm} \{\sqrt{y^2 + 2x}\}> \frac{2}{3}
{
x
2
+
2
y
}
>
3
2
;
{
y
2
+
2
x
}
>
3
2
Show that
x
=
y
x = y
x
=
y
.Here
{
x
}
\{x\}
{
x
}
denotes the fractional part of
x
x
x
. For example,
{
3.14
}
=
0.14
\{3.14\} = 0.14
{
3.14
}
=
0.14
.Proposed by Anton Trygub
8.2
1
Hide problems
Oleksiy Is a Tennis Gambler
In one country, a one-round tennis tournament was held (everyone played with everyone exactly once). Participants received
1
1
1
point for winning a match, and
0
0
0
points for losing. There are no draws in tennis. At the end of the tournament, Oleksiy saw the number of points scored by each participant, as well as the schedule of all the matches in the tournament, which showed the pairs of players, but not the winners. He chooses matches one by one in any order he wants and tries to guess the winner, after which he is told if he is correct. Prove that Oleksiy can act in such a way that he is guaranteed to guess the winners of more than half of the matches.Proposed by Oleksiy Masalitin
8.1
1
Hide problems
Sums and Products on Chessboard
Oleksiy placed positive integers in the cells of the
8
×
8
8\times 8
8
×
8
chessboard. For each pair of adjacent-by-side cells, Fedir wrote down the product of the numbers in them and added all the products. Oleksiy wrote down the sum of the numbers in each pair of adjacent-by-side cells and multiplied all the sums. It turned out that the last digits of both numbers are equal to
1
1
1
. Prove that at least one of the boys made a mistake in the calculation. For example, for a square
3
×
3
3\times 3
3
×
3
and the arrangement of numbers shown below, Fedir would write the following numbers:
2
,
6
,
8
,
24
,
15
,
35
,
2
,
6
,
8
,
20
,
18
,
42
2, 6, 8, 24, 15, 35, 2, 6, 8, 20, 18, 42
2
,
6
,
8
,
24
,
15
,
35
,
2
,
6
,
8
,
20
,
18
,
42
, and their sum ends with a digit
6
6
6
; Oleksiy would write the following numbers:
3
,
5
,
6
,
10
,
8
,
12
,
3
,
5
,
6
,
9
,
9
,
13
3, 5, 6, 10, 8, 12, 3, 5, 6, 9, 9, 13
3
,
5
,
6
,
10
,
8
,
12
,
3
,
5
,
6
,
9
,
9
,
13
, and their product ends with a digit
0
0
0
.\begin{tabular}{| c| c | c |} \hline 1 & 2 & 3 \\ \hline 2 & 4 & 6 \\ \hline 3 & 5 & 7 \\ \hline \end{tabular} Proposed by Oleksiy Masalitin and Fedir Yudin