Rhea goes to a jeweler with four 3-link chains and asks him to join them together to make a 12-link chain. On a normal day, he would make 4 cuts and will join them together for making a 12-link chain. But today he is feeling clever and he finds a new way to link them which will require less cuts.
The jeweler cut 3 links from the single 3-link chain and he obtained three single links. The he joined the remaining three 3-link chains using them. In such manner, he had to make just 3 cuts. Refer the picture to understand better.
You can place weights on both side of weighing balance and you need to measure all weights between 1 and 1000. For example if you have weights 1 and 3,now you can measure 1,3 and 4 like earlier case, and also you can measure 2,by placing 3 on one side and 1 on the side which contain the substance to be weighed. So question again is how many minimum weights and of what denominations you need to measure all weights from 1kg to 1000kg.
n a hotel, a man was sleeping when he heard a knock on the door. He shifted the blanket and stepped down from the bed. He waked to the door and opened it to find a stranger standing outside.
Upon opening the gate, that stranger said, "Pardon me, I must have made a mistake. I thought this was my room."
The stranger then walked the corridor and climbed down the stairs. The man closed the door and immediately called the security. He asked them to arrest that stranger immediately.
Why did he asked them to arrest that stranger? What made him suspicious?
You are giving an intelligence test. In that, you are provided by the code - MOD OAT AIM DUE TIE
You know that only one word from this code is true and the rest ones are only put in to make the task difficult for you. To understand, you are provided with a clue – If you are told any one of the characters of the code word, you can find out the word easily.
Can you deduce the actual code word from the entire code?
Let us assume that the word is MOD. Now if you are told one character of this word, you would not be able to identify the number of vowels in the word. For example if you are told M, then the word can be MOD or AIM but they both have different number of vowels. If you are told about O, then there are two words MOD and OAT which again have different number of vowels. If you are told about D, there are two words again MOD and DUE which have different numbers of vowels again.
In such manner, all the words that have M, O or D in them can be excluded. Then only word that remains is TIE.
If you are told about T, there are two words OAT and TIE which both have two vowels.
If you are told about I, there are two words AIM and TIE which both have two vowels.
If you are told about E, there are two words DUE and TIE which both have two vowels.
A strange tradition is followed in an orthodox and undeveloped village. The chief of the village collects taxes from all the males of the village yearly. But it is the method of taking taxes that is interesting.
The taxes paid in the form of grains and every male should pay equal pounds corresponding to his age. In simpler terms, a man aged 10 years will have to pay 10 pounds of grains and a 20 years old will be paying 20 pounds of grain.
The chief stands on a riser containing 7 different weights next to a large 2 pan scale. As per the interesting custom, the chief can only weigh using three of the seven weights.
In such a scenario, can you calculate what must be the weights of the seven weights each and who is the oldest man the chief can measure using those weights?
Imagine that you are travelling to a village. You happen to reach a point in the road where there is a fork. There are two ways that you can go into but only one amongst them is correct and leads to the village. You happen to see two men standing on the fork and you can ask them for the direction. To your bad luck, one amongst the two men always lies and the other one always says the truth. But you do not know who is a liar and who is not. At that point of the situation you are allowed to ask only one question to any one of the men standing there.
You can ask this question to any one person, "if I ask the man who is next you: which is the correct way and the road to the village, what would the person next to you answer?"
If you happened to ask this question to the liar, he will show you the wrong way.
And if you happened to ask this question to the one who says truth, he will also show you the wrong way.
Once you are done with this, take the other way. This will lead you to the village
We know that Christanio Ronaldo tells the truth on only a single day of the week. If the statement on day 1 is untrue, this means that he tells the truth on Monday or Tuesday. If the statement on day 3 is untrue, this means that he tells the truth on Wednesday or Friday. Since Christanio Ronaldo tells the truth on only one day, these statements cannot both be untrue. So, exactly one of these statements must be true, and the statement on day 2 must be untrue.
Assume that the statement on day 1 is true. Then the statement on day 3 must be untrue, from which follows that Christanio Ronaldo tells the truth on Wednesday or Friday. So, day 1 is a Wednesday or a Friday. Therefore, day 2 is a Thursday or a Saturday. However, this would imply that the statement on day 2 is true, which is impossible. From this we can conclude that the statement on day 1 must be untrue.
This means that Christanio Ronaldo told the truth on day 3 and that this day is a Monday or a Tuesday. So day 2 is a Sunday or a Monday. Because the statement on day 2 must be untrue, we can conclude that day 2 is a Monday.
So day 3 is a Tuesday. Therefore, the day on which Christanio Ronaldo tells the truth is Tuesday.
You can see the figure or draw one of your own. The scenario is as shown. There are three houses represented with the triangle over the square. There are three utilities: W, G and E representing water, gas and electricity respectively.
Can you draw a line and get each utility into every house (9) total lines without ever crossing any line?
100 cowboys are standing in a circle and are numbered from number 1 to 100. A deadly game is created in which the first person will shoot the next person (i.e.second person) and then need to pass the gun to the next person (i.e. Third person) and he will shoot the person to the next. This game will continue until one cowboy stays alive.