I knew I'd seen this before and that felt like a trap because I half-remembered the answer but not the reasoning.
Start by reframing the problem: each bulb is toggled once for every divisor of its number. Then determine that a bulb ends up on if and only if it has an odd number of divisors, which happens exactly for perfect squares. Finally, list the perfect squares up to 100 and explain the reasoning clearly.
Pro tip: Mention that this is a classic problem and that the key insight is recognizing the divisor toggling pattern; then generalize to any N by stating the answer is the perfect squares up to N.
Clarify that there are 100 bulbs initially off, and person i toggles bulbs that are multiples of i. The goal is to find which bulbs are on after all 100 people.
For a given bulb k, it is toggled by person i if and only if i divides k. So the number of toggles equals the number of divisors of k.
A bulb ends up on if it is toggled an odd number of times. Since most numbers have an even number of divisors, only numbers with an odd number of divisors remain on.
A number has an odd number of divisors if and only if it is a perfect square, because divisors pair up except when the number is a square (the square root pairs with itself).
The perfect squares from 1 to 100 are 1, 4, 9, 16, 25, 36, 49, 64, 81, 100. These are the bulbs left on.
AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.