In a far away land, it was known that if you drank poison, the only way to save yourself is to drink a stronger poison, which neutralizes the weaker poison. The king that ruled the land wanted to make sure that he possessed the strongest poison in the kingdom, in order to ensure his survival, in any situation. So the king called the kingdom's pharmacist and the kingdom's treasurer, he gave each a week to make the strongest poison. Then, each would drink the other one's poison, then his own, and the one that will survive, will be the one that had the stronger poison. The pharmacist went straight to work, but the treasurer knew he had no chance, for the pharmacist was much more experienced in this field, so instead, he made up a plan to survive and make sure the pharmacist dies. On the last day the pharmacist suddenly realized that the treasurer would know he had no chance, so he must have a plan. After a little thought, the pharmacist realized what the treasurer's plan must be, and he concocted a counter plan, to make sure he survives and the treasurer dies. When the time came, the king summoned both of them. They drank the poisons as planned, and the treasurer died, the pharmacist survived, and the king didn't get what he wanted. What exactly happened there?

The treasurer's plan was to drink a weak poison prior to the meeting with the king, and then he would drink the pharmacist's strong poison, which would neutralize the weak poison. As his own poison he would bring water, which will have no effect on him, but the pharmacist who would drink the water, and then his poison would surely die. When the pharmacist figured out this plan, he decided to bring water as well. So the treasurer who drank poison earlier, drank the pharmacist's water, then his own water, and died of the poison he drank before. The pharmacist would drink only water, so nothing will happen to him. And because both of them brought the king water, he didn't get a strong poison like he wanted.

logicEmperor Akbar once ruled over India. He was a wise and intelligent ruler; and he had in his court the Nine Gems, his nine advisors, who were each known for a particular skill. One of these Gems was Birbal, known for his wit and wisdom. The story below is one of the examples of his wit. Do you have it in you to find the answer? One day the Emperor Akbar stumbled on a small rock in the royal gardens and momentarily went off balance. He was in a bad mood that day and the incident only served to make him more angry. Finding a target for his mood of the day, he ordered the gardener's arrest and execution. Birbal heard of this and visited the gardener in the cell where he was being held awaiting execution. Birbal had known the gardener for many years and also knew of the gardener's immense respect and sense of loyalty for the king. He decided to help the gardener escape the death sentence and explained his plan to the gardener, who reluctantly agreed to go along. The next day the gardener was asked what his last wish was before he was hanged, as was custom. The gardener requested an audience with the emperor. This wish was granted, but when the man neared the throne he tried to attack the emperor. The emperor was shocked and demanded an explanation. The gardener looked at Birbal, who stepped forward and explained why the gardener had attacked the emperor. The emperor immediately realised how unjust he had been and ordered the release of the gardener. How did Birbal manage this?

"Your Majesty," said Birbal, "there is probably no person more loyal to you than this unfortunate gardener. Fearing that people would say you hanged him for a silly reason and question your sense of justice, he went out of his way to give you a genuine reason for hanging him."

logic A man was in a small town for the day, and needed a haircut. He noticed that there were only two barbers in town, and decided to apply a bit of logical deduction to choosing the best one. Looking at their shops, he saw that the first one was very neat and the barber was clean shaven with a nice haircut. The other shop was a mess, and the barber there needed a shave and had a bad cut besides.Why did the man choose to go to the barber with the messy shop?

Since even barbers rarely try to cut their own hair, and there are only two barbers in town, they must cut each other's hair. The one with the neat hair must have it cut by the one with the bad haircut, who must then be better one, considering his own haircut.

logic Jay escaped from jail and headed to the country. While walking along a rural road, he saw a police car speeding towards him. Jay ran toward it for a short time and then fled into the woods. Why did he run toward the car?

Jay was just starting to cross a bridge when he saw a police car. He ran toward the car to get off the bridge before running into the woods.

logicYou have 25 horses. When they race, each horse runs at a different, constant pace. A horse will always run at the same pace no matter how many times it races.
You want to figure out which are your 3 fastest horses. You are allowed to race at most 5 horses against each other at a time. You don't have a stopwatch so all you can learn from each race is which order the horses finish in.
What is the least number of races you can conduct to figure out which 3 horses are fastest?

You need to conduct 7 races.
First, separate the horses into 5 groups of 5 horses each, and race the horses in each of these groups. Let's call these groups A, B, C, D and E, and within each group let's label them in the order they finished. So for example, in group A, A1 finished 1st, A2 finished 2nd, A3 finished 3rd, and so on.
We can rule out the bottom two finishers in each race (A4 and A5, B4 and B5, C4 and C5, D4 and D5, and E4 and E5), since we know of at least 3 horses that are faster than them (specifically, the horses that beat them in their respective races).
This table shows our remaining horses:
A1 B1 C1 D1 E1
A2 B2 C2 D2 E2
A3 B3 C3 D3 E3
For our 6th race, let's race the top finishers in each group: A1, B1, C1, D1 and E1. Let's assume that the order of finishers is: A1, B1, C1, D1, E1 (so A1 finished first, E1 finished last).
We now know that horse D1 cannot be in the top 3, because it is slower than C1, B1 and A1 (it lost to them in the 6th race). Thus, D2 and D3 can also not be in the to 3 (since they are slower than D1).
Similarly, E1, E2 and E3 cannot be in the top 3 because they are all slower than D1 (which we already know isn't in the top 3).
Let's look at our updated table, having removed these horses that can't be in the top 3:
A1 B1 C1
A2 B2 C2
A3 B3 C3
We can actually rule out a few more horses. C2 and C3 cannot be in the top 3 because they are both slower than C1 (and thus are also slower than B1 and A1). And B3 also can't be in the top 3 because it is slower than B2 and B1 (and thus is also slower than A1). So let's further update our table:
A1 B1 C1
A2 B2
A3
We actually already know that A1 is our fastest horse (since it directly or indirectly beat all the remaining horses). So now we just need to find the other two fastest horses out of A2, A3, B1, B2 and C1. So for our 7th race, we simply race these 5 horses, and the top two finishers, plus A1, are our 3 fastest horses.

logicprobabilityYour friend shows you two jars, one with 100 red marbles in it, the other with 100 blue marbles in it.
He proposes a game. He'll put the two jars behind his back and tell you to pick one of them at random. You'll then close your eyes, he'll hand you the jar you picked, and you'll pick a random marble from that jar.
You win if the marble you pick is blue, and you lose otherwise.
To give you the best shot at winning, your friend gives you the two jars before the game starts and says you can move the marbles around however you'd like, as long as all 200 marbles are in the 2 jars (that is, you can't throw any marbles away).
How should you move the marbles around to give yourself the best chance of picking a blue marble?

Put one blue marble in one jar, and put the rest of the marbles in the other jar. This will give you just about a 75% chance of picking a blue marble.

logicIt was a Pink Island. There were 201 individuals lived in the island. Among them 100 people were blue eyed people, 100 were green eyed people and the leader was a black eyed one.
Except the leader, nobody knew how many individuals lived in the island. Neither have they known about the color of the eyes. The leader was a very strict person. Those people can never communicate with others. They even cannot make gestures to communicate. They can only talk and communicate with the leader. It was a prison for those 200 individuals.
However, the leader provided an opportunity to leave the island forever but on one condition. Every morning he questions the individuals about the color of the eyes! If any of the individuals say the right color, he would be released. Since they were unaware about the color of the eyes, all 200 individuals remained silent. When they say wrong color, they were eaten alive to death. Afraid of punishment, they remained silent.
One day, the leader announced that "at least 1 of you has green eyes! If you say you are the one, come and say, I will let you go if you are correct! But only one of you can come and tell me!"
How many green eyed individuals leave the island and in how many days?

All 100 green eyed individuals will leave in 100 days.
Consider, there is only one green eyed individual lived in the island. He will look at all the remaining individuals who have blue eyes. So, he can get assured that he has green eyes! If there were more than one green eyed people, when the first man looks at the second one with green eyes, the person didn’t leave on day the first day. It means he also has green eyes and the same rule applies to each green eyed man.

logicshortHow far can you run into the woods?

Half way. If you go in any further, you’d be running OUT of the woods.

cleanlogicmathMick and John were in a 100 meter race. When Mick crossed the finish line, John was only at the 90 meter mark. Mick suggested they run another race. This time, Mick would start ten meters behind the starting line. All other things being equal, will John win, lose, or will it be a tie in the second race?

John will lose again. In the second race, Mick started ten meters back. By the time John reaches the 90 meter mark, Mick will have caught up him. Therefore, the final ten meters will belong to the faster of the two. Since Mick is faster than John, he will win the final 10 meters and of course the race.

logicYou have just purchased a small company called Company X. Company X has N employees, and everyone is either an engineer or a manager. You know for sure that there are more engineers than managers at the company.
Everyone at Company X knows everyone else's position, and you are able to ask any employee about the position of any other employee. For example, you could approach employee A and ask "Is employee B an engineer or a manager?" You can only direct your question to one employee at a time, and can only ask about one other employee at a time. You're allowed to ask the same employee multiple questions if you want.
Your goal is to find at least one engineer to solve a huge problem that has just hit the company's factory. The problem is so urgent that you only have time to ask N-1 total questions.
The major problem with questioning the employees, however, is that while the engineers will always tell you the truth about other employees' roles, the managers may lie to you if they like. You can assume that the managers will do their best to confuse you.
How can you find at least one engineer by asking at most N-1 questions?

You can find at least one engineer using the following process:
Put all of the employees in a conference room. If there happen to be an even number of employees, pick one at random and send him home for the day so that we start with an odd number of employees. Note that there will still be more engineers than managers after we send this employee home.
Then call them out one at a time in any order. You will be forming them into a line as follows:
If there is nobody currently in the line, put the employee you just called out in the line.
Otherwise, if there is anybody in the line, then we do the following. Let's call the employee currently at the front of the line Employee_Front, and call the employee who we just called out of the conference room Employee_Next.
So ask Employee_Front if Employee_Next is a manager or an engineer.
If Employee_Front says "manager", then send both Employee_Front and Employee_Next home for the day.
However, if Employee_Front says "engineer", then put Employee_Next at the front of the line.
Keep doing this until you've called everyone out of the conference room. Notice that at this point, you'll have asked N-1 or less questions (you asked at most one question each time you called an employee out except for the first employee, when you didn't ask a question, so that's at most N-1 questions).
When you're done calling everyone out of the conference room, the person at the front of the line is an engineer. So you've found your engineer!
But the real question: how does this work?
We can prove this works by showing a few things.
First, let's show that if there are any engineers in the line, then they must be in front of any managers.
We'll show this with a proof by contradiction. Assume that there is a manager in front of an engineer somewhere in the line. Then it must have been the case that at some point, that engineer was Employee_Front and that manager was Employee_Next. But then Employee_Front would have said "manager" (since he is an engineer and always tells the truth), and we would have sent them both home. This contradicts their being in the line at all, and thus we know that there can never be a manager in front of an engineer in the line.
So now we know that after the process is done, if there are any engineers in the line, then they will be at the front of the line. That means that all we have to prove now is that there will be at least one engineer in the line at the end of the process, and we'll know that there will be an engineer at the front.
So let's show that there will be at least one engineer in the line. To see why, consider what happens when we ask Employee_Front about Employee_Next, and Employee_Front says "manager". We know for sure that in this case, Employee_Front and Employee_Next are not both engineers, because if this were the case, then Employee_Front would have definitely says "engineer". Put another way, at least one of Employee_Front and Employee_Next is a manager. So by sending them both home, we know we are sending home at least one manager, and thus, we are keeping the balance in the remaining employees that there are more engineers than managers.
Thus, once the process is over, there will be more engineers than managers in the line (this is also sufficient to show that there will be at least one person in the line once the process is over). And so, there must be at least one engineer in the line.
Put altogether, we proved that at the end of the process, there will be at least one engineer in the line and that any engineers in the line must be in front of any managers, and so we know that the person at the front of the line will be an engineer.