RMM 2021 Problem 3
Source: RMM 2021/3
October 13, 2021
combinatoricsRMM
Problem Statement
A number of workers stand in a row. Every contiguous group of at least workers is a . 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 . Prove that the number of such ways to assign the leaders is divisible by .Mikhail Antipov, Russia