MathDB
guards in a museum

Source: Portugal OPM 2018 p5

May 15, 2024
combinatorics

Problem Statement

A museum wants to protect its most valuable piece by maintaining constant surveillance. To do this, he wants to place guards to watch the place, in shifts of 77 consecutive hours. Each guard starts his shift at the same time every day. A guard is essential if there is any time during the day when you are alone to watch the item. Indicates all possibilities for the number of guards guarding the piece, so that everyone is indispensable.