There are 100 bulbs in a room. 100 strangers have been accumulated in the adjacent room. The first one goes and lights up every bulb. The second one goes and switches off all the even-numbered bulbs - second, fourth, sixth... and so on. The third one goes and reverses the current position of every third bulb (third, sixth, ninth? and so on.) i.e. if the bulb is lit, he switches it off and if the bulb is off, he switches it on. All the 100 strangers progress similarly.
After the last person has done what he wanted, which bulbs will be lit and which ones will be switched off?
My first is in chocolate but not in ham. My second is in cake and also in jam. My third at tea time is easily found. Altogether, this is a friend who is often around. What is it?
If the number is divided by 3, it gives the remainder of 1;
If the number is divided by 4, it gives the remainder of 2;
If the number is divided by 5, it gives the remainder of 3;
If the number is divided by 6, it gives the remainder of 4.
You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?