Archive for the ‘M@th puzzles’ Category


There was a friends get together event, after a long time. And everyone shake hands with every friend.

If there was total #66 handshakes, find the number of friends met up that evening.

Have a good day!



Friends, the one u can see below is a puzzle designed by Google. It almost killed me wen i tried to solve, and unfortunately i could’nt solve. But the answer is pretty interesting. Pls break ur heads to reach the answer :).

A duck, pursued by a fox, escapes to the center of a perfectly circular pond. The fox cannot swim, and the duck cannot take flight from the water (it’s a deficient duck). The fox is four times faster than the duck. Assuming the fox and duck pursue optimum strategies, is it possible for the duck to reach the edge of the pond and fly away without being eaten? If so, how?

Crossing the desert

Posted: September 22, 2009 in M@th puzzles
Tags: , ,

You have to cross a large desert that is 1,000 km long. You have a horse and 3,000 apples. The horse can carry a maximum of 1,000 apples at any time. For every kilometer that the horse needs to travel, it eats one apple before it can start moving. What is the maximum number of
uneaten apples that the horse can transport to the other end of the desert?

Try 2 solve this.Mail me for more info..

Red balls & Green balls

Posted: June 17, 2009 in M@th puzzles
Tags: ,

Bag A has 10 Red balls and Bag B has 10 Green balls.

Shuffle bag A move three balls from A to B then
Shuffle bag B move three balls from B to A

Which bag is likely have more number of balls of other color.

Note: Solution is simple if u need help mail me.

100 Doors

Posted: June 9, 2009 in M@th puzzles
Tags: ,

100 closed lockers. You begin by opening all 100 lockers. Next, you close every second locker. Then you go to every third locker and close it if it is open or open it if it is closed (call this toggling the locker). After your 100th pass of the hallway, in which you toggle only locker number 100, how many lockers are open?



Posted: May 25, 2009 in M@th puzzles
Tags: ,


You have two jars and 100 marbles. Fifty of the marbles are red, and 50 are blue. One of the jars will be chosen at random; then 1 marble will be withdrawn from that jar at random. How do you maximize the chance that a red marble will be chosen? (You must place all 100 marbles in the jars.) What is the chance of selecting a red marble when using your scheme?