A Scientist was able to create clone for David Beckham, he called him D, now since D is a clone he is nowhere near Beckham at football/soccer skills. But D has peculiar ability when he takes penalty shoot, the probability that D will score a goal is proportional to the goals he scored in all his previous attempts (for example he scored 3 times out of 8 then the probability he will score at 9th shoot is 3/8). In first 2 shoots he scored 1 and missed 1, with this information you bet that he scores 125 goals out of 256 tries/shoots, the probability you win is a/b (a and b are coprimes). then find (b^2 - a^2)
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.
The problem can be considered as a Polya's Urn , so that the probability of scoring k goals after n trials, given that you performed α goals out of α + β initial trials, is
p ( n , k ) = ( k n ) B ( α , β ) B ( k + α , n − k + β )
where B is the beta function. In our case n = 2 5 6 − 2 = 2 5 4 , since two trials have been performed, one of them being a goal, so α = 1 and β = 1 . Eventually, k = 1 2 5 − 1 = 1 2 4 . Substituing
p ( 2 5 4 , 1 2 4 ) = ( 1 2 5 2 5 4 ) B ( 1 , 1 ) B ( 1 2 5 + 1 , 2 5 4 − 1 2 4 + 1 ) = 2 5 5 1 = b a ⟹ b 2 − a 2 = 2 5 5 2 − 1 = 6 5 0 2 4
Problem Loading...
Note Loading...
Set Loading...
let n be the total number of shoots and r be number of goals scored that you have bet on. Given that there was one hit and one miss, we are left with (n-2) total shots. This will have (n-r-1) misses and (r-1) hits
Let us see the term corresponding to the product of all Hits (all terms from 1 to 124, multiplied), so : (r-1)! In the denominator, we will have all the terms from 2 to 255. so, the denominator will have (n-1)!
Now let us calculate the product of the remaining terms : the (n-r-1) misses. If you write down any particular case, you will notice that all the misses consist of the product of consecutive terms from 2 to 130 . Thus making the term (n-r-1)!.
The question is , how many such cases exist? To answer that question, let us rephrase this subproblem this way - In how many ways can we distribute (n-r-1) identical objects in r boxes ( in and around r - 1 objects)
The number of ways of distributing p identical objects in q different boxes is
( q − 1 p + q − 1 )
So we get the total number of cases : ( r − 1 n − r − 1 + r − 1 ) = ( r − 1 n − 2 )
So, the final term is ( n − 1 ) ! ( r − 1 ) ! ( n − r − 1 ) ! ( r − 1 n − 2 ) = ( n − 1 ) ! ( r − 1 ) ! ( n − r − 1 ) ! ( r − 1 ) ! ( n − r − 1 ) ! ( n − 2 ) !
= n − 1 1
= 2 5 5 1
So, no matter what you bet, the probability of winning is always the same(it is independent of r). If n is the total number of shots, then the probability that your guess is correct is always n − 1 1