Hayley has a deck of x cards, each labelled distinctly with an integer from 1 to x , where x ≥ 3 . She randomly picks 2 cards from the deck and sees that they have the numbers a and b written on them, where b > a . Without replacing those 2 cards, she then randomly takes another card from the deck, which has the number c written on it.
Define the function p ( x ) to be the probability that a < c < b for a deck of x cards. Find the value of
k = 3 ∑ 2 0 1 5 p ( k )
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.
In each "game," you are drawing three cards from the deck. The probability p ( x ) is effectively the probability that the "middle card" is the last of the three that you draw, which is 3 ! 2 ! = 3 1 . Note that this is the case regardless of the value of x .
So the value of the sum is
k = 3 ∑ 2 0 1 5 3 1 = 3 2 0 1 3 = 6 7 1 .
Firstly, let us calculate p ( x ) for generic x : If b − a = n + 1 then there are x − n − 1 possibilities for the pair ( a , b ) and n possibilities for c such that a < c < b . The total number of possibilities ( a , b , c ) without the condition that c is necessarily between a and b is ( 2 x ) × ( x − 2 ) = 2 x ( x − 1 ) ( x − 2 ) Therefore: p ( x ) = 2 x ( x − 1 ) ( x − 2 ) n = 1 ∑ x − 2 n ( x − n − 1 ) Splitting the summand down into its component parts and from there evaluating each part using known results, we get p ( x ) = 2 x ( x − 1 ) ( x − 2 ) 2 ( x − 1 ) ( x − 1 ) ( x − 2 ) − 6 ( x − 2 ) ( x − 1 ) ( 2 x − 3 ) In fact pretty much all of these terms cancel out after a bit of simplifying, to leave p ( x ) = 3 1 irrespective of x . Therefore k = 3 ∑ 2 0 1 5 p ( k ) = 2 0 1 3 × 3 1 so the answer is 6 7 1
Problem Loading...
Note Loading...
Set Loading...
For any 3 cards chosen, with the numbers a , b , c on them, since they are different, there are only 2 ways out of the 3 ! = 6 ways to draw them from the deck, such that a < c < b , namely ( a , b , c ) or ( b , a , c ) . Note that the order of the first 2 cards, a and b , can be swapped around because they are drawn together in the question and the value of b is automatically the larger number of the two. Thus, p ( x ) = 6 2 = 3 1 for any value of x ≥ 3 .
Hence, the value of
k = 3 ∑ 2 0 1 5 p ( k ) = ( 2 0 1 5 − 3 + 1 ) × 3 1 = 2 0 1 3 × 3 1 = 6 7 1