A basketball player has a constant probability of of making any given shot, independent of previous shots. Let be the ratio of shots made to shots attempted after shots. The probability that and for all such that is given to be where , , , and are primes, and , , and are positive integers.
Submit the value of as your answer.
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.
Let X n be the number of shots made in n consecutive attempts. We know that a n = n X n . Since a 1 0 = 0 . 4 = 5 2 we have that
a 1 0 = 5 2 = 1 0 X 1 0 ⟹ X 1 0 = 4
Let t = ( t 1 , . . . , t 1 0 ) the trials vector such that
t i = { 1 , 0 , if he/she makes a shot otherwise , i ∈ [ 0 , 1 0 ]
resulting in X n = i = 1 ∑ n t i . We also know that a n ≤ 0 . 4 for n ∈ [ 1 , 9 ] , so
a n = n X n ≤ 5 2 ⟹ X n ≤ ⌊ 5 2 n ⌋
and
X 1 = 0 , X 2 = 0 , X 3 ≤ 1 , X 4 ≤ 1 , X 5 ≤ 2 , X 6 ≤ 2 , X 7 ≤ 2 , X 8 ≤ 3 , X 9 ≤ 3
and eventually X 1 0 = 4 , as we previously said. Let's rewrite t = ( 0 0 ∣ t 3 , t 4 ∣ t 5 , t 6 , t 7 ∣ t 8 , t 9 ∣ 1 ) and put the remaning three 1 s in t , following the boundaries previously written. I'll use the notation ∣ ⋅ ∣ ⋅ ∣ ⋅ ∣ to indicate the number ( # ) of 1 s will appear between the bars, i.e. the number of 1 s assigned to the t i between the bars (the rest will be 0 s ), and for each of them we'll count the number of possible combination. Hence
# ( ∣ 1 ∣ 1 ∣ 1 ∣ ) = 2 ⋅ 3 ⋅ 2 = 1 2 # ( ∣ 1 ∣ 0 ∣ 2 ∣ ) = 2 # ( ∣ 0 ∣ 2 ∣ 1 ∣ ) = 2 ⋅ 3 = 6 # ( ∣ 0 ∣ 1 ∣ 2 ∣ ) = 3
Summing up 2 + 1 2 + 6 + 3 = 2 3 , so that the final probability is
P ( a 1 0 = 0 . 4 ∧ a n ≤ 0 . 4 , 1 ≤ n ≤ 9 ) = 2 3 ( 5 2 ) 4 ( 1 − 5 2 ) 6 = 9 7 6 5 6 2 5 2 6 8 2 7 2 = 5 1 0 2 4 ⋅ 3 6 ⋅ 2 3
Eventually
( p + q + r + s ) ( a + b + c ) = ( 2 + 3 + 2 3 + 5 ) ( 4 + 6 + 1 0 ) = 6 6 0