## A Variation on Flipping Lightbulb Switches, pt. 1

by JT Cho •##Introduction Problem. Suppose you are in a room with $n$ lightbulbs and $k$ switches, where $1 \leq n$ and $1 \leq k$. Suppose that any particular switch turns a subset of light bulbs on. Find the minimum number of switches such that flipping them on turns on all of the . . .