A bag contains of rice. Mayank and Akul to get some rice from it. If they take less than percent of what it originally contained, the Lord of the Rice kills both of them instantly. If not, then He changes the amount of rice to of what it previously contained. Also the lower limit becomes 20 percent of the new content and the same thing continues. Find the probability that they will safely get the food atleast times, where is for .
Details and Assumptions
All the made are random without any prior strategy between the two.
If one doesn't get what he , then also they would have to die. For example if Mayank wishes 80 gm and Akul wishes 40 gm, then one of them won't be ssatisfied and then they would be killed.
For example if they were successful at the first time the bag content would become 50 gm, then 25 gm and so on.
4. denotes greatest integer function
We've got more for you at the set Mayank and Akul
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
First of all see that the value of n must be 3 . If you got 2 after applying am gm, see that am gm is not valid here(why, it would be fun to reason it out)
Let's say Mayank took x grams and Akul took y grams.
After their first chance, for their safety 2 0 < x + y < 1 0 0 where x and y are real numbers between 0 and 100.
Now how to find the probability that the above statement is valid.
Well the answer lies in the area between lines x+y =20 and x+y =100 bound between the lines x=0,y=0,x=100,y=100
Divide it by the total area (100x100) for the probability.
Next 1 0 < x + y < 5 0 Again find the area and divide it by 50x50.
Do that one more time and that's the answer by :-
. 4 8 ∗ . 4 8 ∗ . 4 8