What is so fragile that saying its name breaks it?

A patient was diagnosed with some ailment. He was given five different tablets to take at night at an interval of 15 minutes.

How long will it take the patient to consume all the five tablets?

John is pretty weird. He likes toffees but hates chocolates. He loves books but never reads. He likes to build his troops in an online game but does not proceed with the war. He likes to go swimming but is afraid of water.

Seeking this behaviour, can you tell whether he likes balloons and parties?

There is a square piece of paper with a hole that is denoted by the circle on the top right side in the given picture. You have to cut the paper in a manner that it forms two and only two separate pieces of paper and then rearrange the pieces in a manner that the holes come in the centre of the paper.

It is deaf, Dumb and Blind!!!

Still, always tells the truth. What is it?

A boy was at a carnival and went to a booth where a man said to the boy, "If I write your exact weight on this piece of paper then you have to give me $50, but if I cannot, I will pay you $50." The boy looked around and saw no scale so he agrees, thinking no matter what the carny writes he'll just say he weighs more or less. In the end the boy ended up paying the man $50. How did the man win the bet?

Can you find the odd number in the following five choices?

1) 482636
2) 259807
3) 865195
4) 104739
5) 391744

A B C D E F G H

These are the letters given to you. Now you have to find out the letter that comes two to the right of the letter which is immediately to the left of the letter that comes three to the right of the letter that comes midway between the letter two to the left of the letter C and the letter immediately to the right of the letter F.

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.

In order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?