MathDB
Problems
Contests
International Contests
Romanian Masters of Mathematics Collection
2021 Romanian Master of Mathematics
3
3
Part of
2021 Romanian Master of Mathematics
Problems
(1)
RMM 2021 Problem 3
Source: RMM 2021/3
10/13/2021
A number of
17
17
17
workers stand in a row. Every contiguous group of at least
2
2
2
workers is a
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
i
t
a
l
i
c
′
>
b
r
i
g
a
d
e
<
/
s
p
a
n
>
<span class='latex-italic'>brigade</span>
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
i
t
a
l
i
c
′
>
b
r
i
g
a
d
e
<
/
s
p
an
>
. The chief wants to assign each brigade a leader (which is a member of the brigade) so that each worker’s number of assignments is divisible by
4
4
4
. Prove that the number of such ways to assign the leaders is divisible by
17
17
17
.Mikhail Antipov, Russia
combinatorics
RMM