[Combinatorics]
Problem: Elizabeth is in an "escape room" puzzle. She is in a room with one door which is locked at the start of the puzzle. The room contains $n$ light switches, each of which is initially off. Each minute, she must flip exactly $k$ different light switches (to "flip" a switch means to turn it on if it is currently off, and off if it is currently on). At the end of each minute, if all of the switches are on, then the door unlocks and Elizabeth escapes from the room.

Let $E(n, k)$ be the minimum number of minutes required for Elizabeth to escape, for positive integers $n, k$ with $k \leq n$. For example, $E(2,1)=2$ because Elizabeth cannot escape in one minute (there are two switches and one must be flipped every minute) but she can escape in two minutes (by flipping Switch 1 in the first minute and Switch 2 in the second minute). Define $E(n, k)=\infty$ if the puzzle is impossible to solve (that is, if it is impossible to have all switches on at the end of any minute).

For convenience, assume the $n$ light switches are numbered 1 through $n$.
Compute the $E(9,5)$

Solution: $E(9,5)=3$. Notice that $E(9,5) \neq 1$ because each switch must be flipped at least once, and only five switches can be flipped in one minute. Notice also that $E(9,5) \neq 2$ because after two minutes, there have been 10 flips, but in order to escape the room, each switch must be flipped at least once, and this requires 9 of the 10 flips. However, the tenth flip of a switch returns one of the nine switches to the off position, so it is not possible for Elizabeth to escape in two minutes. In three minutes, however, Elizabeth can escape with the sequence $\{1,2,3,4,5\},\{1,2,3,6,7\},\{1,2,3,8,9\}$.

Final answer: 3