MathDB
Problems
Contests
National and Regional Contests
Switzerland Contests
Switzerland - Final Round
2021 Switzerland - Final Round
2021 Switzerland - Final Round
Part of
Switzerland - Final Round
Subcontests
(5)
7
1
Hide problems
combinatorics
Let
m
≥
n
m \ge n
m
≥
n
be positive integers. Frieder is given
m
n
mn
mn
posters of Linus with different integer dimensions of
k
×
l
k \times l
k
×
l
with
1
≥
k
≥
m
1 \ge k \ge m
1
≥
k
≥
m
and
1
≥
l
≥
n
1 \ge l \ge n
1
≥
l
≥
n
. He must put them all up one by one on his bedroom wall without rotating them. Every time he puts up a poster, he can either put it on an empty spot on the wall or on a spot where it entirely covers a single visible poster and does not overlap any other visible poster. Determine the minimal area of the wall that will be covered by posters.
1
1
Hide problems
game with dandelions
Let
(
m
,
n
)
(m,n)
(
m
,
n
)
be pair of positive integers. Julia has carefully planted
m
m
m
rows of
n
n
n
dandelions in an
m
×
n
m \times n
m
×
n
array in her back garden. Now, Jana un Viviane decides to play a game with a lawnmower they just found. Taking alternating turns and starting with Jana, they can now mow down all the dandelions in a straight horizontal or vertical line (and they must mow down at least one dandelion ). The winner is the player who mows down the final dandelion. Determine all pairs of
(
m
,
n
)
(m,n)
(
m
,
n
)
for which Jana has a winning strategy.
6
1
Hide problems
Irritated function
Let
N
\mathbb{N}
N
be the set of positive integers. Let
f
:
N
→
N
f: \mathbb{N} \rightarrow \mathbb{N}
f
:
N
→
N
be a function such that for every positive integer
n
∈
N
n \in \mathbb{N}
n
∈
N
f(n) -n<2021 \text{and} f^{f(n)}(n) =n Prove that
f
(
n
)
=
n
f(n)=n
f
(
n
)
=
n
for infinitely many
n
∈
N
n \in \mathbb{N}
n
∈
N
5
1
Hide problems
Integers in the row
For which integers
n
≥
2
n \ge 2
n
≥
2
can we arrange numbers
1
,
2
,
…
,
n
1,2, \ldots, n
1
,
2
,
…
,
n
in a row, such that for all integers
1
≤
k
≤
n
1 \le k \le n
1
≤
k
≤
n
the sum of the first
k
k
k
numbers in the row is divisible by
k
k
k
?
3
1
Hide problems
NT with finite set
Find all finite sets
S
S
S
of positive integers with at least
2
2
2
elements, such that if
m
>
n
m>n
m
>
n
are two elements of
S
S
S
, then
n
2
m
−
n
\frac{n^2}{m-n}
m
−
n
n
2
is also an element of
S
S
S
.