ASU 473 All Soviet Union MO 1988 forms 10A, 10B have 29, 32 students resp.
Source:
August 8, 2019
combinatoricsgamegame strategy
Problem Statement
Form has students who are listed in order on its duty roster. Form has students who are listed in order on its duty roster. Every day two students are on duty, one from form and one from form . Each day just one of the students on duty changes and is replaced by the following student on the relevant roster (when the last student on a roster is replaced he is replaced by the first). On two particular days the same two students were on duty. Is it possible that starting on the first of these days and ending the day before the second, every pair of students (one from and one from ) shared duty exactly once?