Computer Science

Summary and thinking on Bulb Switcher problem

Bulb Switcher


There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it’s off or turning off if it’s on). For the ith round, you toggle every i bulb. For the nth round, you only toggle the last bulb. Find how many bulbs are on after n rounds.

You can find the problem at

I’m not going to talk about how to actually code the problem here, just want to share how I thought and finally got to the best solution.