John's five friends Rachel, Jacob, Phoebe, Joey and Chandler live on the same road.

Rachel lives in the house: A, Jacob lives in the house: B, Phoebe lives in the house: C, Joey lives in the house:D, Chandler lives in the house: E

Mathematically
B*C*D = 1260
B + C + D = 2E
2A = E

The road numbers run from 2 to 222.

Can you tell me the house number of each of John's friends?

John was writing his first book. After saving the document, he locked his laptop with a password and mentioned some phrases for the hint box.

A friend of his tried opening his laptop but found out that it was password protected. Following is the hint that appeared.
1 mobile 3 books 2 roars 1 night 4 balls 2 lighters 1 ghost 1 hat 3 watches.

Can you help him in cracking the password?

Prove that twice of ten is the same as twice of eleven.

A rubber ball keeps on bouncing back to 2/3 of the height from which it is dropped. Can you calculate the fraction of its original height that the ball will bounce after it is dropped and it has bounced four times without any hindrance ?

What does the following represent?

N N N N N N N

A A A A A A A

C C C C C C C

This was asked in an interview with Coa-Cola.

The interviewer has given me 100 marbles(50 white and 50 black) and two empty boxes.
He then told me that he will leave the room and i need to place all the marbles in two boxes.

And When he come back, he will draw a marble from any of the two box and if the marble is white I will be hired.

Also
* No box can be empty.
* All 100 marbles must be placed in one of the two boxes.

So what should I have done?

What time is it when an elephant sits on a fence?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?

2 ladies and 2 girls need to cross a river in a boat big enough for 1 LADY or 2 girls. How do they do it?

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?