# Latest content was relocated to https://bintanvictor.wordpress.com. This old blog will be shutdown soon.

## Friday, July 12, 2013

### 100-lightbulb problem, with my solution

Q: There are 100 switched-off light bulbs along a staircase. Visitor #1 walks upstairs, pushing the on/off switch at each bulb. Visitor #2 walks upstairs hitting bulb #2,4,6...100. Visitor #3 to #100 each walks upstairs. In the end how many light bulbs are on? Can you tell me which bulbs are on? Can you tell me how many times each bulb has turned on?

For each integer between 1 and 100, factor it into "prime" factors. For eg, 72 = 2x2x2x3x3. Each integer is then expressed in the "Beautiful" form like A^n x B^m x C^p... where ABC are increasing prime numbers and nmp are exponents. For eg, 72 = 2^3 x 3^2.

Now (n+1)(m+1)(p+1)... is the number of "toggles" received by the light bulb. For eg, Bulb#72 gets 12 toggles. Bulb 10 gets 4 toggles (due to 2^1 x 5^1). Bulb 13 gets 2 toggles (due to 13^1).

Now let me defined Group-E and Group-O --
If (n+1)(m+1)(p+1)... is even, then the light bulb is in Group-E.
If (n+1)(m+1)(p+1)... is odd, then the light bulb is in Group-O.

Now, (n+1)(m+1)(p+1)... is usually an even integer. It's odd only if n,m,p... are all even -- for eg Bulb#4, #64, #36, ...-- Group-O. It's easy to list all of them.

2^2,  2^4,  2^6,  3^2 , 3^4,  5^2,  7^2
2^2x3^2,  2^2x5^2

For all the "prime" bulbs like #2, #3 ... #37..., the beautiful form looks like A^1, so these prime bulbs each gets 2 toggles exactly. Therefore Group-E.

Special cases -- Bulb #1 gets togged only once -- Group-O.

It turned out Group-O is the group of square numbers.