If you drop me I’m sure to crack, but give me a smile and I’ll always smile back. What am I?

Jack and Joseph are well-known golf rivals. One Day during a match, they were level at a score of 30. Jack hit a bad shot and Joseph added 10 to his score. Joseph then hit an awesome shot and he won the game.

How ?

The doctor advised his patient to take a tablet after every fifteen minutes. He gave him five tablets in total.

How much time will he take to have all the five tablets?

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.

On rolling two dices (six-sided normal dice) together, what is the probability that the first one comes up with a 2 and the second one comes up with a 5?

One day Jenifer meets the Lion and the Tiger in the Forest of Forgetfulness. She knows that the Lion lies on Mondays, Tuesdays, and Wednesdays, and tells the truth on the other days of the week. The Tiger, on the other hand, lies on Thursdays, Fridays, and Saturdays, but tells the truth on the other days of the week. Now they make the following statements to Jenifer:

Lion: Yesterday was one of my lying days.

Tiger: Yesterday was one of my lying days too.

What day is it?

A non-stop marathon is the shared favourite sport of three brothers.

*The oldest one is fat and short and trudges slowly on.
*The middle brother's tall and slim and keeps a steady pace.
*The youngest runs just like the wind, speeding through the race.

"He is young in years, we let him run!" the other two brothers explained, "'because though he is surely number one, he is second, in a way." Why is it?

what one word does the below rebus identifies?

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?

Find the number of squares in the below-given picture.