There are 100 doors. 100 strangers have been gathered in the adjacent room. The first one goes and opens every door. The second one goes and shuts down all the even numbered doors – second, fourth, sixth. The third one goes and reverses the current position of every third door (third, sixth, ninth and so on.) i.e. If the door is open, he shuts it and if the door is shut, he switches opens it.
Find a plethora of unique matchstick riddles and challenge your mind if it can achieve the desired result by moving a. Cracking codes do sound like such an. Nov 18, 2017 5 Brain-Cracking Riddles Only the Sharpest Minds Can Solve Watch Again//Watch This Channel/https. 16 has the divisors 1 & 16, 2 & 8, 4&4. But 4 is recurrent because 16 is a perfect square, so you will only visit door number 16, on pass 1, 2, 4, 8 and 16 leaving it open at the end. ![]() So only perfect square doors will remain open at the end. Three college toppers are summoned by the inspecting faculty. To identify the best from them, the faculty takes them into a room and places one hat on each of their heads. Now all of them can see the hats on other’s heads but can’t see his own. There are two colored hats – green and red. Now the faculty announces that he had made sure that the competition is extremely fair to all three of them. He also gives them a hint that at least one of them is wearing a red hat. Now the first one who is able to deduce his own hat color will be awarded the most intelligent student of all award. After a few minutes, one of them raises his hand and is able to deduce the color correctly. Solution: There are two things to keep in mind: Firstly there is at least one red hat. (There can be two or three as well). Secondly the competition is fair for everyone. ![]() Thus if there is only one red hat, that person will see two green hats on other heads and will be able to deduce his own color as red. However the other students will see one red and one green hat and can never be sure. In such manner, the competition will prove to be partial for one student. Suppose if there are two red hats. Then the students who are wearing red hats will see one red and one green hat on others. Now they must have deduced that there can’t be just one red hat. Thus they will know that they are also wearing a red hat. Windows 8.1 gamer edition. But the one who is wearing a green hat will see two red hats and can never be sure of his own color. In this case as well, the competition will not be fair. Thus the only possible and fair means is if all of them are wearing a red hat. The one who is able to deduce the situation first, will raise his hand and will tell the correct answer. Mind Cracking RiddlesSolution: The 100th statement for sure is incorrect because it says that at least 100 of the statements are incorrect. Suppose if that is correct, then 100 statements cannot be true. This suggests that the 100th statement is incorrect and that the first statement is true. Similarly 99 statements cannot be true because if they were true, then two statements would become correct i.e. The 1st and the 99th. But the 99th statement says that at least 99 are incorrect. This suggests that the 99th statement is incorrect and that 2ndone is true. Mind Cracking GamesIf we keep analyzing is the same way till the end, we will find out that only the first fifty statements are true and all the remaining ones are incorrect.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |