At first, there were 2 apples on the tree. After the wind blew, one apple fell on the ground. So there where no apples on the tree and there were no apples on the ground.
*apples => more than one apple
Another solution(non tricky one)
The wind blew so hard that the apples fell of the tree and blew along the ground.
Suppose there is a Christmas tree and four angels are sitting on it amidst the other ornaments. Two of them have black halos and two of them have white halos. No body among them can see above their head. Angel A is sitting on the top branch and can see angels B and C sitting below him. B can see C who is sitting in a branch lower than his. Angel D is at the base of the tree and can't be seen due to the branches in between. Also, he can't see anybody as well.
If they are asked to guess the color of their own halo (they dont know that), who do you think will be able to deduce and speak up first with a right answer?
Now there can be two solutions to the given situation because there can be two situations:
Suppose if B and C have same colors, A will know that his color is the other one and he will be able to speak up the first.
Now if B and C do not have same colors, A will stay silent. This will tell B that his and C's colors are different. Thus he will speak up first.
So either A or B will speak up first depending on the situation.
Birbal is a witty trader who trade of a mystical fruit grown far in north. He travels from one place to another with three sacks which can hold 30 fruits each. None of the sack can hold more than 30 fruits. On his way, he has to pass through thirty check points and at each check point, he has to give one fruit for each sack to the authorities.
How many mystical fruits remain after he goes through all the thirty check points?
Remember we told you that Birbal is a witty trader. So his sole motive is to get rid of the sacks as fast as he can.
For the first sack:
He must be able to fill fruits from one sack to other two sacks. Assume that he is able to do that after M check points. Now to find M,
(Space in first sack) M + (Space in second sack) M = (Remaining fruits in Third Sack) 30 – M
M = 10
Thus after 10 checkpoints, Birbal will be left with only 2 sacks containing 30 fruits each.
Now he must get rid of the second sack.
For that, he must fill the fruits from second sack to the first sack. Assume that he manages to do that after N checkpoints.
(Space in First Sack) N = (Remaining fruits in second sack) 30 – N
N = 15
Thus after he has crossed 25 checkpoints, he will be left be one sack with 30 fruits in it. He has to pass five more checkpoints where he will have to give five fruits and he will be left with twenty five fruits once he has crossed all thirty check points.
In front of you, there are 9 coins. They all look absolutely identical, but one of the coins is fake. However, you know that the fake coin is lighter than the rest, and in front of you is a balance scale. What is the least number of weightings you can use to find the counterfeit coin?
The answer is 2. First, divide the coins into 3 equal piles. Place a pile on each side of the scale, leaving the remaining pile of 3 coins off the scale. If the scale does not tip, you know that the 6 coins on the scale are legitimate, and the counterfeit is in the pile in front of you. If the scale does tip, you know the counterfeit is in the pile on the side of the scale that raised up. Either way, put the 6 legitimate coins aside. Having only 3 coins left, put a coin on each side of the scale, leaving the third in front of you. The same process of elimination will find the counterfeit coin.
I was invited on a pet show by a fellow colleague. Since I was a bit busy that day, I sent my brother to the show. When he returned back I asked him about the show. He told me that all except two animals were fishes, all except two animals were cats and all except two entries were dogs.
To his statement I was a bit puzzled and I could not understand how many animals of each kind were present in that pet show. Can you tell me?
The question might appear a bit difficult in the starting but if you analyze the statements, you will realize that it is just a tricky one.
All except two were fishes and all except two were cats. With these statements we can assume that two of the animals were not fishes and two were not cats. Now one of those animals that are not fishes can be a cat and one of those two animals that are not cats can be a fish. Just carry out the same analysis for the statement that all except two animals were not dogs and you will come across the result i.e.:
In that competition, there was one fish, one cat and one dog.
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?
Aishwarya Rai walks into a bank to cash out her check.
By mistake the bank teller gives her dollar amount in change, and her cent amount in dollars.
On the way home she spends 5 cent, and then suddenly she notices that she has twice the amount of her check.
Three college toppers are summoned by the inspecting faculty. To identify the best from them, the faculty takes them into a room and places one hat on each of their heads. Now all of them can see the hats on other’s heads but can’t see his own. There are two colored hats – green and red.
Now the faculty announces that he had made sure that the competition is extremely fair to all three of them. He also gives them a hint that at least one of them is wearing a red hat. Now the first one who is able to deduce his own hat color will be awarded the most intelligent student of all award. After a few minutes, one of them raises his hand and is able to deduce the color correctly.
There are two things to keep in mind:
Firstly there is at least one red hat. (There can be two or three as well).
Secondly the competition is fair for everyone.
Thus if there is only one red hat, that person will see two green hats on other heads and will be able to deduce his own color as red. However the other students will see one red and one green hat and can never be sure. In such manner, the competition will prove to be partial for one student.
Suppose if there are two red hats. Then the students who are wearing red hats will see one red and one green hat on others. Now they must have deduced that there can’t be just one red hat. Thus they will know that they are also wearing a red hat. But the one who is wearing a green hat will see two red hats and can never be sure of his own color. In this case as well, the competition will not be fair.
Thus the only possible and fair means is if all of them are wearing a red hat. The one who is able to deduce the situation first, will raise his hand and will tell the correct answer.