If,
9 * 8 * 7 = 65
8 * 7 * 6 = 50
7 * 6 * 5 = 37

Find
6 * 5 * 4 = ?

It's a test that will check your IQ.

Suppose you have one 11 minute hourglass and one 13 minute hourglass.

Can you measure exactly fifteen minutes using them ?

4 fathers, 2 grand-fathers and 4 sons went to watch the movie.What is the minimum number of tickets they need to buy ?

Today, I celebrated my 32nd birthday but I was born in 1972.
How is this possible?

Aaron, Brad, Christopher, Danny and Elvis decided to play a game of tiddlywinks. In this game they decided that one win will get 1 point for winning, 0 for losing and 1/2 in case of a tie.

They finished the game in alphabetical order and it was found that the scores were different for each person.

Based on the following two statements, can you find out the result of the individual games?
Brad: No one could finish like me, without a loss.
Elvis: No one played worse than me, I finished without a single win.

A hen, a dog, and a cat are stolen. Three suspects are arrested named Robin, Steve, and Tim. The police are sure that all of them stole one of the animals but they don't know who stole which animal.

Sherlock Holmes is appointed to identify and is provided with the following statements from the investigation.

Robin - Tim stole the hen
Steve - Tim stole the dog
Tim - Both Robin and Steve are lying. I neither stole a hen nor a dog.

Sherlock is somehow able to deduce that the man who stole the cat is telling a lie and the man who stole the hen is telling truth.

Can you help him find out who stole which animal?

A pack of cards has 40 cards. You are blindfolded. Out of 40, 25 cards are facing down while 15 are facing up. You have been asked to divide this pack of cards into two decks - so that each deck contains an equal number of face-up cards. Remember, you are blindfolded.

How will you do it?

If two fifty-foot ropes are suspended from a forty-foot ceiling that is twenty feet apart, how much rope will you be able to steal if you have a knife?

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?

What is the fewest number of coins that would be required in order to make sure each and every coin touches exactly three other coins?