Alex is asked to stand behind Ryan and Ryan is asked to stand behind Alex. Both of them feel confused about it and don’t know what to do?
But it is quite possible, do you know how?
If Alex and Ryan stand back to back, then they can make it possible.
Can you tell a 3D object that actually has just two surfaces?
Did you think of paper?
Well that will be a wrong answer as a piece of paper has 6 surfaces as the edges are also counted as surfaces only no matter how thin they are.
The correct answer is a cone.
A dying old man wants to divide his entire land between his only two sons. Since his only wish is to treat them as equal as both of them have been too good to him, he wants to divide his land equally between them. The problem is that the land is significantly irregular in shape and thus there is no choice of cutting them in two equal halves.
Can you help him divide the land in a manner that both of his sons will be happy ?
All he need to do is ask one of his son to divide the land in two part and tell him that the other son will have the choice of selecting one of those two halves.
In this manner both of them will be happy.
If an earthquake is 1 point higher on the Richter Scale than another earthquake which is actually 10 times stronger, how much stronger would an earthquake be if it was just half a point higher on the Richter scale?
The most common answer would be 5. But that’s totally incorrect. It will be the square root of 10 times stronger i.e. 3.16 times.
Two friends were stuck in a cottage. They had nothing to do and thus they started playing cards. Suddenly the power went off and Friend 1 inverted the position of 15 cards in the normal deck of 52 cards and shuffled it. Now he asked Friend 2 to divide the cards into two piles (need not be equal) with equal number of cards facing up. The room was quite dark and Friend 2 could not see the cards. He thinks for a while and then divides the cards in two piles.
On checking, the count of cards facing up is same in both the piles. How could Friend 2 have done it ?
Friend 2 must have taken top 15 cards from the pile and reversed them. Now there are two piles, one with 15 cards and one with 37 cards and both of them will obviously have the same number of inverted cards.
If you want to understand mathematically, let us say that there were x inverted cards in the top 15 cards of the deck. Then the remaining 37 cards will comprise of 15-x number of inverted cards.
If we reverse the 15 cards the number of inverted cards will become 15-x and the number of inverted cards will be same in both the piles.
There are two bottles that consists of different pills each. You must take the two pills at the same time and if you forget, or just take one of them or take two of the same kind, you will die a miserable death. In a hurry, you pour from both the bottles at the same time and three pills fall down in your hand.
Now you can’t throw away the pills as they are quite rare to be found. Also both of the pills look exactly the same and have all the characteristics similar. How will you ensure that you don’t take a wrong pill and die ?
All you have to do is labelling the pills as A and B. Now when you draw out three pills, you will either have 3A or 2A 1B or 1A 2B or 3B. Now if all the pills are from same bottle you can simply take another from the other bottle. If some other combination comes out, you can manage by filling in from the required bottles.
Can you find out the smallest number that can be conveyed as the sum of three squares in three unique ways ?
54
7^2 + 2^2 + 1^1
6^2 + 3^2 + 3^2
2^2 + 5^2 + 5^2
During an experiment, a guy throws a bouncy ball from a 90 feet tall building. The ball has a specific characteristic. Every time it hits the ground, it bounces up half way.
How many bounces do you think the ball will make before it comes to a stop ?
Clearly as per the data given in the question, the ball will always keep on bouncing half way up and thus it will take infinite bounces before the gravity forces it to stop.
The wisest men of the kingdom are called upon by the king to his court. One of them is to be chose for the advisor rank and thus they shall prove their worth in the test. The king places hat on each of their hats. Each one of them can see other two hats but can't see his own. The hats are either white or black.
For a hint, the king tells them that at least one of them is wearing a black hat. Also the king declares that the test is totally fair for each one of them. Now the first one from them who is able to deduce the color of hat he is wearing will be designated as the advisor. After a few minutes, one of them was able to deduce the color of his own hat. How ?
Suppose that there is just one black hat. In such a scenario, the person wearing it will see the other two hats as white and then as the king had announced, he will be easily able to judge that he is wearing a black hat himself. But the other two men will see a black hat and a white hat and will not be able to judge. Thus this will be an unfair situation, so we can rule it out.
Now suppose that there are two black hats. Then, both the person will see a white hat and a black hat. And they have already realized that there must be two black hats, thus they can easily deduce that they are also wearing a black hat. But the one wearing white hat will see two black hats and thus he will not be able to identify on a sure note. Thus the competition will not be fair.
Thus the only situation where the competition can be fair is when all the hats are black. The first one who recognize the fact will stand up and say black.
