For each permutation a 1 , a 2 , . . . , a 1 0 of the integers 1 , 2 , 3 , . . . , 1 0 , form the sum ∣ a 1 − a 2 ∣ + ∣ a 3 − a 4 ∣ + ∣ a 5 − a 6 ∣ + ∣ a 7 − a 8 ∣ + ∣ a 9 − a 1 0 ∣ . Find the average value of all such sums correct up to 2 decimal places.
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.
There is a simpler (?) solution based on the ideas of the linearity of expectation, which you have tangentially touched on.
The expected contribution of 10 is clearly 10, since it would always be positive added. The expected contribution of 9 is 9 8 × 9 + 9 1 × ( − 9 ) , because it will only be negatively added when paired with 10. This results in the sum that you stated.
The difference lies in thinking about ∣ a 1 − a 2 ∣ as ± ( a 1 − a 2 ) , as opposed to counting the number of times that ∣ a 1 − a 2 ∣ = k occurs.
Problem Loading...
Note Loading...
Set Loading...
Let the average value of ∣ a i − a j ∣ be n . Then, the average value of ∣ a 1 − a 2 ∣ + ∣ a 3 − a 4 ∣ + ∣ a 5 − a 6 ∣ + ∣ a 7 − a 8 ∣ + ∣ a 9 − a 1 0 ∣ is 5 n . Let n k be the number of ∣ a i − a j ∣ = k .
For k = 1 , we have ∣ ± 1 ∓ 2 ∣ , ∣ ± 2 ∓ 3 ∣ , ∣ ± 3 ∓ 4 ∣ , ∣ ± 4 ∓ 5 ∣ , ∣ ± 5 ∓ 6 ∣ , ∣ ± 6 ∓ 7 ∣ , ∣ ± 7 ∓ 8 ∣ , ∣ ± 8 ∓ 9 ∣ and ∣ ± 9 ∓ 1 0 ∣ . Therefore, n 1 = 1 8 . Similarly, n 2 = 1 6 , n 3 = 1 4 , ⇒ n k = 2 ( 1 0 − k ) .
We know that n is the expected value of n k and it is given by:
n = k = 1 ∑ 9 n k k = 1 ∑ 9 k n k = k = 1 ∑ 9 2 ( 1 0 − k ) k = 1 ∑ 9 2 k ( 1 0 − k ) = k = 1 ∑ 9 k k = 1 ∑ 9 k ( 1 0 − k ) = 1 0 − k = 1 ∑ 9 k k = 1 ∑ 9 k 2 = 1 0 − 6 9 ( 1 0 ) ( 1 9 ) × 9 ( 1 0 ) 2 = 1 0 − 3 1 9 = 3 1 1
Therefore, the required answer 5 n = 5 × 3 1 1 = 1 8 . 3 3 to two decimal places.