A school teacher was worried as the school superintendent was scheduled to visit the next day. He would definitely ask mental arithmetic from the class and she will have to pick a student for answering. The problem that persisted was not all students of her class were intelligent and she wanted to put a perfect impression on the superintendent. Suddenly she came up with an idea that relieved her of the stress. She went to her class and told students something that will maximize the chances of picking the right student.
She simply asked everyone to raise hands on hearing the question. The only condition was that the ones who knew the correct answer will raise right hand and other will raise left hand facilitating her in acknowledging the ones to pick for answering.
On a random day , i was not able to logged-in with my bank password , so i contacted them on phone.
Our conversation is stated as :
myself : My password is altered.
myself : I am not able to logged-in.
customer-executive : Your password is distinct this time and it got 8 letters , out of which 2 are same of your previous password.
myself: Thanks , now i am able to logged-in.
A river should be crossed by a father, a mother and their two sons and two daughters.
There are some rules that should be followed while crossing the river. There can be only two people in the raft while crossing. The daughters cannot be with their father unless there is the presence of the mother. The sons cannot be with their mothers unless the father is present. Unless the guard is on the board, the criminals cannot be with any of the family members. Only the adults like the father, the guard, and the mother knows to use the raft.
The guard and the prisoner cross the river
The guard comes back
The guard and the girl cross the river.
The guard and the prisoner comes back.
The mother and the girl cross the river.
Mother comes back
The mother and the father cross the river
Father comes back
The guard and the prisoner cross the river
Mother comes back
The father and the mother cross the river
Father comes back
The father and the boy cross the river
The guard and the prisoner comes back
The guard and the boy cross the river
The guard comes back
The guard and the prisoner cross the river.
A man wronged the king and thus he was put under a trial for murder. But the king knew that the person was innocent. Also he was suspicious that his innocence will soon come out among the people. Thus, he decided to play a game of chance on the name of their almighty god.
He summoned all the people along with the accused person. He put in two chits of paper inside a bowl. He told the people that one chit has ‘Guilty’ written over it and the other one has ‘Innocent’ written over it. He tells the people that the god will decide if the accused person is culprit or not. He then asks the person to draw a chit.
Obviously, the king is cheating and he has written ‘Guilty’ over both the chits. So no matter what chit the person picks, everybody will believe that it is lord's judgment and no one will bother to look at the other chit. Even the accused person knows it that the king had played a full proof game.
What should he do in order to be conceived as an innocent person?
He should draw any chit of paper and before unfolding it, he must eat and swallow the chit. In this manner, to determine the judgment of the god, they will have to look at the other chit which will have 'Guilty' written over it. Thus everyone will believe that the chit which he ate had innocent written over it and thus they will believe that he is innocent.
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... and so on. 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. All the 100 strangers progresses in the similar fashion.
After the last person has done what he wanted, which doors will be left open and which ones will be shut at the end?
Think deeply about the door number 56, people will visit it for every divisor it has. So 56 has 1 & 56, 2 & 28, 4 & 14, 7 & 8. So on pass 1, the 1st person will open the door; pass 2, 2nd one will close it; pass 4, open; pass 7, close; pass 8, open; pass 14, close; pass 28, open; pass 56, close.
Thus we can say that the door will just end up back in its original state for each pair of divisor. But what about the cases in which the pair of divisor has analogous number for example door number 16? 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.
You are stuck with the pirates who might even kill you on board. They give you a chance to survive. There are hundred black rocks and hundred red rocks. There are two empty sacks which are labelled as heads and tails respectively. You have to divide the rocks in two bags as per your wish. Then a fair coin will be flipped. If its heads, you will have to pick a rock on random from the sack labelled heads and if its tails, you will pick up from the tails sack. If you pick up a black rock, you will be freed and if you pick up a red rock, you will be killed.
How will you distribute the rocks so that your chances of survival are the best?
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.
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)
You are the ruler of a medieval empire and you are about to have a celebration tomorrow. The celebration is the most important party you have ever hosted. You've got 1000 bottles of wine you were planning to open for the celebration, but you find out that one of them is poisoned.
The poison exhibits no symptoms until death. Death occurs within ten to twenty hours after consuming even the minutest amount of poison.
You have over a thousand slaves at your disposal and just under 24 hours to determine which single bottle is poisoned.
You have a handful of prisoners about to be executed, and it would mar your celebration to have anyone else killed.
What is the smallest number of prisoners you must have to drink from the bottles to be absolutely sure to find the poisoned bottle within 24 hours?
10 prisoners must sample the wine. Bonus points if you worked out a way to ensure than no more than 8 prisoners die.
Number all bottles using binary digits. Assign each prisoner to one of the binary flags. Prisoners must take a sip from each bottle where their binary flag is set.
Here is how you would find one poisoned bottle out of eight total bottles of wine.
Bottle 1 Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle 6 Bottle 7 Bottle 8
Prisoner A X X X X
Prisoner B X X X X
Prisoner C X X X X
In the above example, if all prisoners die, bottle 8 is bad. If none die, bottle 1 is bad. If A & B dies, bottle 4 is bad.
With ten people there are 1024 unique combination so you could test up to 1024 bottles of wine.
Each of the ten prisoners will take a small sip from about 500 bottles. Each sip should take no longer than 30 seconds and should be a very small amount. Small sips not only leave more wine for guests. Small sips also avoid death by alcohol poisoning. As long as each prisoner is administered about a milliliter from each bottle, they will only consume the equivalent of about one bottle of wine each.
Each prisoner will have at least a fifty percent chance of living. There is only one binary combination where all prisoners must sip from the wine. If there are ten prisoners then there are ten more combination where all but one prisoner must sip from the wine. By avoiding these two types of combination you can ensure no more than 8 prisoners die.
One viewer felt that this solution was in flagrant contempt of restaurant etiquette. The emperor paid for this wine, so there should be no need to prove to the guests that wine is the same as the label. I am not even sure if ancient wine even came with labels affixed. However, it is true that after leaving the wine open for a day, that this medieval wine will taste more like vinegar than it ever did. C'est la vie.
The husband had booked two tickets for departure and only one for the return. The travel agent told this information to the police and they immediately came to know that he had planned the murder right from the beginning.
Submit your Email Address to get latest post directly to your inbox.