100 Locker Problem Solution Java

The Locker Problem

Initializing live version

Download to Desktop

Fullscreen

Imagine a hallway with 100 lockers, all airtight. 100 students are sent down the hall equally follows: student 1 opens all the lockers; student 2 closes every other locker, beginning with the second; student three changes the country of every third locker, beginning with the 3rd; and then on. After all the students have marched, which lockers remain open? This Demonstration illustrates the changing locker states every bit the students march. Black squares represent closed lockers and white squares represent open lockers. The first row in the graphic shows the initial hallway with locker 1 on the left and locker 100 on the right. Each subsequent row shows the hallway after the side by side student has marched, with the bottom row showing the final locker configuration. The user can select certain subsets of the students to send marching, using the convention that pupil will change the country of every locker, beginning with the . Can you see how the final locker land relates to the set of students sent marching?