In a town, there are over 100 flats.
Flat-1 is named first flat.
Flat-2 is named second flat.
Flat-3 is named third flat.

A visitors 'Victor' decides to walk through all the flats, he finds all the flats except flat-62.
Victor later founds that the local of the town have given it another name.

What is the name of the Flat?

You walk into a room where there are three primates held in their respective cages:
1) A lion who is eating the flesh of a goat.
2) An orangutan who is playing with blocks.
3) A donkey who is sitting idle.

Who is the most intelligent primate in the room?

Can you find the key in the picture below?

A wealthy man lives alone in a small cottage. Being partially handicapped he had everything delivered to his cottage. The mailman was delivering a letter one Thursday when he noticed that the front door was ajar. Through the opening he could see the man's body lying in a pool of dried blood. When a police officer arrived he surveyed the scene. On the porch were two bottles of warm milk, Monday's newspaper, a catalog, flyers, and unopened mail. The police officer suspects it was foul play. Who does he suspect and why?

Be active and find the killer in the picture Riddle below.

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.

Decode below three cipher riddles:

26 L of the A
7 D of the W
1000 Y in a M

Decode the below four famous ciphers:

8P of the SS
1M of the E
1S of the SS
60M in 1H

A swan sits at the center of a perfectly circular lake. At an edge of the lake stands a ravenous monster waiting to devour the swan. The monster can not enter the water, but it will run around the circumference of the lake to try to catch the swan as soon as it reaches the shore. The monster moves at 4 times the speed of the swan, and it will always move in the direction along the shore that brings it closer to the swan the quickest. Both the swan and the the monster can change directions in an instant.
The swan knows that if it can reach the lake's shore without the monster right on top of it, it can instantly escape into the surrounding forest.

How can the swan successfully escape?

In The 1st month of this year(the year 2013), I noticed that the date 13-1-13 (13 January 2013) is special.

This date is special as:

Date * Month = Year.

Can you figure out which year of this century has a maximum number of such dates?