Two fathers and two sons decided to go to a shop and buy some sweets upon reaching. Each of them bought 1 kg of sweet. All of them returned home after some time and found out that they had 3kg of sweets with them.

They did not eat the sweets in the way, nor threw or lose anything. Then, how can this be possible?

You are a prisoner sentenced to death. The Emperor offers you a chance to live by playing a simple game. He gives you 50 black marbles, 50 white marbles, and 2 empty bowls. He then says, 'Divide these 100 marbles into these 2 bowls. You can divide them any way you like as long as you use all the marbles. Then I will blindfold you and mix the bowls around. You then can choose one bowl and remove ONE marble. If the marble is WHITE you will live, but if the marble is BLACK... you will die.'

How do you divide the marbles up so that you have the greatest probability of choosing a WHITE marble?

A bag contains 64 balls of eight different colours. There are eight of each colour (including red). What is the least number you would have to pick, without looking, to be sure of selecting 3 red balls?

Jack have ten pairs of black socks, eight pairs of white socks and seven pairs of green socks. Everything is mixed in a draw. As there is no light he were not able to identify the colour of the socks. How many of the socks did he want to take to match one pair

For an extra income, John decided to work at a Hotel for one hour daily. The manager offers him that they will pay him $11 after every 11 days.
However, John offered a different proposition to the manager. The offers stand as:
He will be paid just a penny on his first day.
Two pence will be paid on the second day,
Four pence will be paid on the third day.
And so on till the 11th day.

Should the Hotel manager accept his offer?

A time long back, there lived a king who ruled the great kingdom of Trojan House. As a part of the renovation of the kingdom to meet future security needs, he asked his chief architect to lay down a new play in a manner that all of his 10 castles are connected through five straight walls and each wall must connect four castles together. He also asked the architect that at least one of his castles should be protected with walls. The architect could not come up with any solution that served all of King's choices, but he suggested the best plan that you can see in the picture below. Can you find a better solution to serve the king's demand?

There are four people in a house. A fireman, an athlete, an old woman, and a drunk guy. The house catches fire and before the fact is known, it is too late. All they know is that the entire house is in flames and it will collapse exactly after twelve minutes. Now they can move out of the house but for that, they will have to pass the hallway which is entirely blazing with flames. Thus to move, one must carry a fire extinguisher to keep the flames away. Seeking the burnt wooden floor, only two people can run through that hallway at one time. But for others to go, one must return back with the fire extinguisher. The fireman is trained for such tasks and can run through the hallway in a minute. The athlete can make it in a couple of minutes. The old woman can run slowly and will cover the hallway in four minutes. The drunk guy will take five minutes to run through it. If all of them can make it through the hallway in twelve minutes, all of them will be saved. When two move together, they will run at the speed of the slower ones.

How will all four of them manage to run to safety?

In a family supper, a grandfather, a grandmother, two fathers, two mothers, four children, three grandchildren, one brother, two sisters, two sons, two daughters, one daughter-in-law, and one mother-in-law need to sit at a table.

There are only seven chairs available at the place. How many more chairs do they have to borrow so that everyone can sit down together for the suppers if everybody requires a separate chair?

A man says, "Brothers and sisters, have I none, but that man's father is my father's son." Who is that man?

There is a circular car race track of 10km. There are two cars, Car A and Car B. And they are at the exact opposite end to each other. At Time T(0), Both cars move toward each other at a constant speed of 100 m/seconds. As we know both cars are at the same speed they will always be the exact opposite to each other.
Note, at the center, there is a bug which starts flying towards Car A at time T(0). When the bug reaches car B, it turns back and starts moving towards the car A. The speed of bug is 1m/second. After 5 hours all three stop moving.
What is the total distance covered by the bug?