# Door problem

6 Posts  ·  3 Users
Hi Guys, This is gaurav here. I am working for an MNC. Dimag ko jung nahi lag jaye issiliye prep. for MBA. :: : there was a question i need an answer for: the question starts like thsi : Along a long corridor, there are ...
Page 1 of 1

Post doubt at any of the relevant threads already running in the Quant Section.

Commenting on this post has been disabled by the moderator.

Thanx for the suggestion man!!!!
but i am totally new to this forum and this is quite confusing to handle out.
I thought putting question here will be accessible to evry1.
Can you help me out by providing a better link????

anyway the problem was in one of Career Launcher's Quant funda book

Commenting on this post has been disabled by the moderator.

oops.... dint understand the question was that way...

but anyways... the greater point is that there are a huge number of threads available to discuss all of this and that too with wiser ppl than me... :).... so next time please search for an appropriate thread and post there.... to get u started off, try visitin.... this

modz... the honours?...

Commenting on this post has been disabled by the moderator.

Ok... that's there... but wat about any odd no. or even no... the no. of factors are even for them...
so when the door was initially closed, so at the end od (even) iterations it will be closed only na....
but in case of perfect squares the no. of factors is odd..
so at the end it will be open...
so i feel all nos. except perfect squares will be ope,

wat u say dude????

Commenting on this post has been disabled by the moderator.

dude... if i'm rite... u just need to find out the total number of primes from 1 till 100...

Commenting on this post has been disabled by the moderator.

Hi Guys,

This is gaurav here. I am working for an MNC.
Dimag ko jung nahi lag jaye issiliye prep. for MBA.
:

there was a question i need an answer for:

the question starts like thsi :

Along a long corridor, there are 100 doors. The doors can be in either of two states: closed or open.
initially they are in closed state.
Person no. 1 changes the state of all doors that are a multiple of 1 i.e. basically all doors.
Person no. 2 changes the state of all doors that are a multiple of 2 i.e. even nos and so on till the person no. 100 changes the state of the door that is multiple of 100.
Now how many doors are closed?
pls. explain....

Commenting on this post has been disabled by the moderator.