Flik a famous ant is traveling on a 1000 cm long rope. Flik is traveling at 1cm/seconds, but also entire rope is being stretched by an extra 1000cm/second.
Will the Flik every reach the end of the 1000cm long rope?
Assume that the rope can be stretched forever. Assume the rope is evenly stretched. The moving speed of the end point of the rope (relative to the starting point) is 1000 cm/second.
Each second the ant moves 1cm, at the same time that 1cm rope stretches to be 1000+1000t1000+1000(t−1)= t+1tcm where t is the number of seconds after the ant is on the rope. Therefore, the ant has a moving speed of t+1t cm/second.
Therefore, the moving speed of the ant is far less than the moving speed of the end point of the rope.
Filk will never reach the end of the 1000 cm long rope.
You are given with two ropes with variable width. However if we start burning both the ropes, they will burn at exactly same time i.e. an hour. The ropes are non-homogeneous in nature. You are asked to measure 45 minutes by using these two ropes.
How can you do it?
Please note that you can’t break the rope in half as it is being clearly stated that the ropes are non-homogeneous in nature.
All you have to do is burn the first rope from both the ends and the second rope from one end only simultaneously. The first rope will burn in 30 minutes (half of an hour since we burned from both sides) while the other rope would have burnt half. At this moment, light the second rope from the other end as well. Where, the second rope would have taken half an hour more to burn completely, it will take just 15 minutes as we have lit it from the other end too.
Thus you have successfully calculated 30+15 = 45 minutes with the help of the two given ropes.
This is a classic chess puzzle and considered to be one of the hardest puzzles in history.
As shown in the picture below, White army is arranged in a classic chess board. You need to add black army i.e
in such a way that not a single piece of either color is under attack.
There can be two possibilities for the given situation.
One is if I run on the perimeter. Then, the lion will eventually catch me as the lion can follow my radius and then his trajectory will be half of the circle and not a spiral. Therefore, the lion will subsequently catch me in a finite amount of time.
Secondly if I don’t run on the perimeter, then clearly, I have an infinite amount of time before the lion catches me.
We know that Christanio Ronaldo tells the truth on only a single day of the week. If the statement on day 1 is untrue, this means that he tells the truth on Monday or Tuesday. If the statement on day 3 is untrue, this means that he tells the truth on Wednesday or Friday. Since Christanio Ronaldo tells the truth on only one day, these statements cannot both be untrue. So, exactly one of these statements must be true, and the statement on day 2 must be untrue.
Assume that the statement on day 1 is true. Then the statement on day 3 must be untrue, from which follows that Christanio Ronaldo tells the truth on Wednesday or Friday. So, day 1 is a Wednesday or a Friday. Therefore, day 2 is a Thursday or a Saturday. However, this would imply that the statement on day 2 is true, which is impossible. From this we can conclude that the statement on day 1 must be untrue.
This means that Christanio Ronaldo told the truth on day 3 and that this day is a Monday or a Tuesday. So day 2 is a Sunday or a Monday. Because the statement on day 2 must be untrue, we can conclude that day 2 is a Monday.
So day 3 is a Tuesday. Therefore, the day on which Christanio Ronaldo tells the truth is Tuesday.
You have ten boxes and an electronic weighing machine. In those ten boxes, you have chocolates. Each chocolate weigh 20 grams. But in one box the chocolates are defective and each weigh 19 grams exactly.
Now you can weigh in the electronic weighing machine but you can use that machine just once. How will you find out which box has the defected chocolates.
If you are thinking to hold one chocolate from each box in hand and then balancing weight in bare hands, you are thinking all wrong.
Let us begin by labelling boxes as 1, 2, 3 and so on till 10.
Now pick one chocolate from box 1, two chocolates from box 2, three from box 3 and so on. In total, you will have 55 chocolates now. (1 + 2 + 3 + ..... + 10)
The ideal weight of the chocolates should be 55 * 20 = 1100. However, somewhere in there are the defected chocolate/s.
You can judge that clearly by noting down the result of 1100 - total weight of chocolates. If the weight is less than 1 gram, the defected box is box 1, if the weight is less than 2 grams, the defected box is box 2 and so on.
The ball will take infinite bounces before it is stopped. As per the question it will keep on bouncing half way up every time it hits the ground. But gravity will play its part at certain point of time which will make it stop.
In a jar, there are some orange candies and some strawberry candies. You pick up two candies at a time randomly. If the two candies are of same flavor, you throw them away and put a strawberry candy inside. If they are of opposite flavors, you throw them away and put an orange candy inside.
In such manner, you will be reducing the candies in the jar one at a time and will eventually be left with only one candy in the jar.
If you are told about the respective number of orange and strawberry candies at the outset, will it be feasible for you to predict the flavor of the final remaining candy ?
At each draw, the number of strawberry candies are either decreasing by 2 or not decreasing at all. In the case of orange candies, at each draw, they are either increasing by 1 or decreasing by 1.
Thus on an assumed outset with at least one candy in the jar to begin with, if the number of strawberry candies are 0 or are even in numbers, they will finish off leaving an orange candy at the end. If otherwise, the remaining candy will be a strawberry one.
They have property such that when you light the fire from one end , it will take exactly 60 seconds to get completely burn.
However they do not burn at consistent speed (i.e it might be possible that 40 percent burn in 55 seconds and next 60 percent can burn in 10 seconds).
Imagine that you are travelling to a village. You happen to reach a point in the road where there is a fork. There are two ways that you can go into but only one amongst them is correct and leads to the village. You happen to see two men standing on the fork and you can ask them for the direction. To your bad luck, one amongst the two men always lies and the other one always says the truth. But you do not know who is a liar and who is not. At that point of the situation you are allowed to ask only one question to any one of the men standing there.
You can ask this question to any one person, "if I ask the man who is next you: which is the correct way and the road to the village, what would the person next to you answer?"
If you happened to ask this question to the liar, he will show you the wrong way.
And if you happened to ask this question to the one who says truth, he will also show you the wrong way.
Once you are done with this, take the other way. This will lead you to the village
Submit your Email Address to get latest post directly to your inbox.