There are 100 bulbs in a hall numbered from 1 to 100 with their switches also numbered accordingly.100 students enter the hall one by one and each student operates the switches whose number is a multiple of his order of entering the hall.If all switches were initially off how many will be on after all students have entered?
Example: The student who enters first operates(on) all switches having 1 as a factor. Student no. 2 operates(off) all switches having 2 as a factor.And so on.....
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
For the n th switch, if n has an even number of positive divisors then that switch will end up being off after all the students have entered the hall, and if n has an odd number of positive divisors then that switch will end up being on. The only positive integers that have an odd number of positive divisors are perfect squares, so since 1 0 0 = 1 0 2 there will be 1 0 switches on after all 1 0 0 students enter the hall.