If and are positive integers, find the lowest possible value of .
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 S = { 0 , 1 , 2 , . . . , 8 0 8 4 } . Then there are a total of ( 8 0 8 5 1 6 9 ) ways to select 8 4 + 1 + 8 4 = 1 6 9 distinct elements from S .
Let k be the median of the chosen 169 numbers. Then the range of the possible values of k is the set T = { 8 4 , 8 5 , . . . , 8 0 0 0 } . For each value of k in T , there are ( k 8 4 ) ways to choose 84 numbers which are less than k , and ( 8 0 8 4 − k 8 4 ) ways to choose 84 numbers more which are greater than k , so that k is the median. Therefore there are a total of ( k 8 4 ) ( 8 0 8 4 − k 8 4 ) ways to get the median k .
Thus, ( n r ) = ( 8 0 8 5 1 6 9 ) , so the smallest possible value of n + r is 8254.