Skip to content

Toggled switches after 100 passes

Question

A row of 100100 switches all start in the left position. Person 11 toggles every switch, person 22 toggles switches 2,4,6,…2,4,6,\dots, person 33 toggles every third switch, and so on up to person 100100, who toggles only switch 100100. How many switches end in the right position?

Short answer

10. Switch nn is toggled once for each divisor of nn, so it ends on the right exactly when nn has an odd number of divisors. Divisors pair up as dd and n/dn/d except when nn is a perfect square, and there are 1010 squares up to 100100.

Adapted from OpenQuant; question and answer rewritten by SelfMadeQuant.com.

See the hint and the full worked solution in the question bank (free account).

Open the worked solution

Lessons behind this question

Start with a free lesson: Probability Fundamentals is part of a free topic. Create a free account, no card needed, to read it in full with worked solutions.

Read it free