


























Given $n$ buttons and $n$ bulbs so that the $i$th button toggles the $i$th bulb and perhaps some other bulbs, we compute the sharp lower bound on the number of bulbs that can be lit regardless of the action of the buttons. In the previous article we dealt with the case where each button affects at most 2 or 3 bulbs. In the present article we give sharp lower bounds for up to 4 or 5 wires per switch, and we show that the sharp asymptotic bound for an arbitrary number of wires is $\frac12$. (Even if you've found their buttons, you can please no more than half the people all the time!)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。