Four friends need to cross a dangerous bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?
The initial solution most people will think of is to use the fastest person as an usher to guide everyone across. How long would that take? 10 + 1 + 7 + 1 + 2 = 21 mins. Is that it? No. That would make this question too simple even as a warm up question.
Let’s brainstorm a little further. To reduce the amount of time, we should find a way for 10 and 7 to go together. If they cross together, then we need one of them to come back to get the others. That would not be ideal. How do we get around that? Maybe we can have 1 waiting on the other side to bring the torch back. Ahaa, we are getting closer. The fastest way to get 1 across and be back is to use 2 to usher 1 across. So let’s put all this together.
1 and 2 go cross
2 comes back
7 and 10 go across
1 comes back
1 and 2 go across (done)
An old man in the village feels that his end is near. He calls his two sons to discuss about the land he owns and other properties. He tells them to have a race on their horses till the city border. The one with the slower horse will be rewarded with the entire property.
Both of them keep wandering here or there without any result as no one is filling to reach the border. Then they visit the wise man of the village and seek his advice. The wise men tells them something listening to which they jump on the horses and race as fast as they can till the city border.
A thief was running from the police after the biggest theft the town saw. He took his guard in one of the thirteen caves arranged in a circle. Each day, the thief moves either to the adjacent cave or stay in the same cave. Two cops goes there daily and have enough time to enter any two of the caves out of them.
How will the cop make sure to catch the thief in minimum number of days and what are the minimum number of days?
Step1. Lets say y = x
Step2. Multiply through by x xy = x2
Step3. Subtract y2 from each side xy - y2 = x2 - y2
Step4. Factor each side y(x-y) = (x+y)(x-y)
Step5. Divide both sides by (x-y) y = x+y
Step6. Divide both sides by y y/y = x/y + y/y
Step7. And so... 1 = x/y + 1
Step8. Since x=y, x/y = 1 1 = 1 + 1
Step9. And so... 1 = 2
Step 5 is invalid, because we are dividing by (x-y), and since x=y, we are thus dividing by 0. This is an invalid mathematical operation (division by 0), and so by not following basic mathematical rules
There are three cars in a racing track. The track is made forming a perfect circle and is quite wide so that at one time, multiple cars can pass through it. The car which is leading is driving at 55 MPH and the slowest car is driving at 45 MPH. The car that is in middle of these two is driving in between the two speeds. For the time being you can say that the distance between the fastest car and the middle car is x miles and it is same between the middle car and the slowest car. Also, x is not equal to 0 or 1.
The car keeps running till the leading car catches up with the slowest car and then every car stops. Given the case, do you think that at any point, the distance between any two pairs will again become x miles?
In the question, the distance of x miles is given at a particular moment. The middle car is running at that time at 50 MPH. The distance will keep increasing with time as three are running at different speeds. It will increase by x miles every hour till a certain point of time and then it will start decreasing till the fastest car meets the slowest again.
As per question, all the cars stop then. Thus, the distance will never be x miles again.
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.
David and Albert are playing a game. There are digits from 1 to 9. The catch is that each one of them has to cut one digit and add it to his respective sum. The one who is able to obtain a sum of exact 15 will win the game?
You are a friend of David. Do you suggest him to play first or second?
Let's suppose that David plays first and he picks 9. Then Albert will definitely pick 8. Now, David will have to pick 7 or Albert will pick 7 in his turn. But if David picks up 7, then he will score 16 that is beyond 15 and will lose. So one thing is for sure, no one will be willing to start with the highest digits.
Suppose David plays first and picks up 1, Albert will pick 2. Then David will pick 3 and Albert will pick 4. Now David will be forced to pick 9. The score is 6 to 13 and thus David will have no chance of winning.
If David Picks 9 after Albert has picked up 2, then Albert will pick 8 and the score will become 10 to 10. Thus David will pick 3 as picking 7 will send him past 15. Now Albert will pick 4 and David has nothing to pick for winning. Thus Albert wins.
Therefore, you should suggest David to play second.