Edward James went for tiger hunting.

It was not his lucky day.



He got six tigers without heads, nine tigers without the tail and eight cut in two halves.

How many tiger did he hunted ?

What number does the below three word/phrase identify and why?
1. Deck
2. Year
3. Singing in the Rain

Using eight eights and addition only, can you make 1000?

There are five people. One of them shot and killed one of the other five.
We know following clues:
1. Dan ran in the NY City Marathon yesterday with one of the innocent men.
2. Mike consider being a farmer before he moved to the city.
3. Jeff is a top notch computer consultant and wants to install Ben new computer next week.
4. The murderer had his leg amputated last month.
5. Ben met Jack for the first time six months ago.
6. Jack has been in seclusion since the crime.
7. Dan used to drink heavily.
8. Ben and Jeff built their last computers together.
9. The murderer is Jack's brother. They grew up together in Seattle.

Consider yourself to be a famous detective "Sherlock Homles", Can you find the killer?

In order to complete the racing competition, the Mexico racetrack has to submit its top and the most famous three horses to win the competition. Due to an electrical storm, all the records are cleared and no one knows which horse holds the record. They all look identical and it becomes even more difficult to differentiate the horses. There are 25 horses in the Mexico racetrack. But there can be only five horses at a time on the track. What will the least number of races that can be conducted to find out the three fastest horses?

John has played 50 ODI's and his average is 50. How many runs should he score in his 51st ODI, so that his average score jumps to 51?

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?

Which digit occurred maximum times between the number 1 and 1000?

Can you solve this amazing hard number series problem?
7, 8, 10, 12, 16, 18 ?

A King wants to send the diamond ring to his girlfriend securely. He got multiple locks and their corresponding keys. His girlfriend does not have any keys to these locks and if he sends the key without a lock, the key can be copied in the way. How can King send the ring to his girlfriend securely?