MathDB
Problems
Contests
National and Regional Contests
Romania Contests
Romania Team Selection Test
2024 Romania Team Selection Tests
2024 Romania Team Selection Tests
Part of
Romania Team Selection Test
Subcontests
(3)
P4
1
Hide problems
Do the degrees of freedom matter?
Let
A
A{}
A
be a point in the Cartesian plane. At each step, Ann tells Bob a number
0
⩽
a
⩽
1
0\leqslant a\leqslant 1
0
⩽
a
⩽
1
and he then moves
A
A{}
A
in one of the four cardinal directions, at his choice, by a distance of
a
.
a{}.
a
.
This process cotinues as long as Ann wishes. Amongst every 100 consecutive moves, each of the four possible moves should have been made at least once. Ann's goal is to force Bob to eventually choose a point at a distance greater than 100 from the initial position of
A
.
A.{}
A
.
Can Ann achieve her goal?Selected from an Argentine Olympiad
P3
1
Hide problems
Nice NT with powers of two
Let
n
n{}
n
be a positive integer and let
a
a{}
a
and
b
b{}
b
be positive integers congruent to 1 modulo 4. Prove that there exists a positive integer
k
k{}
k
such that at least one of the numbers
a
k
−
b
a^k-b
a
k
−
b
and
b
k
−
a
b^k-a
b
k
−
a
is divisible by
2
n
.
2^n.
2
n
.
Cătălin Liviu Gherghe
P2
1
Hide problems
Bashy min/max algebra
Let
n
⩾
2
n\geqslant 2
n
⩾
2
be a fixed integer. Consider
n
n
n
real numbers
a
1
,
a
2
,
…
,
a
n
a_1,a_2,\ldots,a_n
a
1
,
a
2
,
…
,
a
n
not all equal and let
d
:
=
max
1
⩽
i
<
j
⩽
n
∣
a
i
−
a
j
∣
;
s
=
∑
1
⩽
i
<
j
⩽
n
∣
a
i
−
a
j
∣
.
d:=\max_{1\leqslant i<j\leqslant n}|a_i-a_j|;\qquad s=\sum_{1\leqslant i<j\leqslant n}|a_i-a_j|.
d
:=
1
⩽
i
<
j
⩽
n
max
∣
a
i
−
a
j
∣
;
s
=
1
⩽
i
<
j
⩽
n
∑
∣
a
i
−
a
j
∣.
Determine in terms of
n
n{}
n
the smalest and largest values the quotient
s
/
d
s/d
s
/
d
may achieve.Selected from the Kvant Magazine