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.
Step1. Lets say y = x
Step2. Multiply through by x xy = x2
Step3. Subtract y2 from each side xy - y2 = x2 - y2
Step4. Factor each side y(x-y) = (x+y)(x-y)
Step5. Divide both sides by (x-y) y = x+y
Step6. Divide both sides by y y/y = x/y + y/y
Step7. And so... 1 = x/y + 1
Step8. Since x=y, x/y = 1 1 = 1 + 1
Step9. And so... 1 = 2
Step 5 is invalid, because we are dividing by (x-y), and since x=y, we are thus dividing by 0. This is an invalid mathematical operation (division by 0), and so by not following basic mathematical rules
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 the given picture, you can find a few numbers. Now you have to fill each square of the grid in a manner that every row and every column contains the digits 1 to 6. Another thing to keep in mind is that the connected squares must have the same number in them.
There is a 30km long bridge. The bridge can only support up to a weight of 2000 kg. A car that weighs 2000 kg needs to cross that bridge. When the car has reached midway of the bridge, a bird comes and sits on top of the car. The bird weighs 300 grams.
Now, does the bridge breaks down at this point of time or not?
You can see the figure or draw one of your own. The scenario is as shown. There are three houses represented with the triangle over the square. There are three utilities: W, G and E representing water, gas and electricity respectively.
Can you draw a line and get each utility into every house (9) total lines without ever crossing any line?