You are an expert on paranormal activity and have been hired to locate a spirit haunting an old resort hotel. Strong signs indicate that the spirit lies behind one of four doors. The inscriptions on each door read as follows:
Door A: It's behind B or C
Door B: Its behind A or D
Door C: It's in here
Door D: It's not in here
Your psychic powers have told you three of the inscriptions are false, and one is true. Behind which door will you find the spirit?
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?
Tarang football website was hacked by one of the players. Jack, the coach of Tarang has pointed out five players as the possible hacker.
Each suspected player made three statements from each suspected player and out of which two are true and one is false.
Joseph
A) I have not hacked the website.
B) I know nothing about hacking.
C) John did it.
Hazard
A) I have not hacked the website.
B) The website was attacked by one of the players.
C) I hate Shelly
Remy
A) I have not hacked the website.
B) I have never seen Oscar in my entire life.
C) I am sure John did it.
John
A) I have not hacked the website.
B) I am sure Oscar did it.
C) Joseph was lying when he said he did it.
Oscar
A) I have not hacked the website.
B) I am sure Hazard did it.
C) I used to be friend with Remy.
You are playing as white and given four rooks to checkmate the black king in four moves with the following rules 1. You can place one rook every move and ensure the black king should be in check position.2. After four moves the black king should be in the checkmate position.
John has eleven friends. He has a bowl containing eleven apples. Now He wants to divide the eleven apples among his friends, in such a way that an apple should remain in his bowl.
How can He do it?
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.