Among points in a plane, no three collinear, exactly pairs are connected by line segments. Each point is then randomly assigned an integer from to inclusive, each equally likely, such that no integer appears more than once. Find the expected value of the number of segments which join two points whose labels differ by at least .
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 are 4 9 5 0 pairs of points, of which we choose 4 0 2 6 to connect with segments. Exactly 1 2 7 5 of these pairs have labels differing by at least 5 0 . So we'd expect that 1 2 7 5 / 4 9 5 0 of the segments join such pairs, which would give us an answer of 4 9 5 0 1 2 7 5 ⋅ 4 0 2 6 = 1 0 3 7 . This is indeed the correct answer.
Why? In general, if S and T are two subsets of a finite set X , chosen randomly among all the subsets with size a and b respectively, then the expected size of S ∩ T is ∣ X ∣ a b . This is due to the fact that the expected value of a sum of random variables is additive , even if the variables are dependent. We can apply this by writing T = { t 1 , t 2 , … , t b } , and considering the random variables Y i = { 1 0 if t i ∈ S if t i ∈ / S . Then E ( ∣ S ∩ T ∣ ) = ∑ i E ( Y i ) = b E ( Y 1 ) = b ⋅ a / ∣ X ∣ , as desired.