Joe picks distinct numbers from the set of the first positive integers . The probability that the sum of the numbers is divisible by can be expressed as , where and are coprime positive integers. What is the 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.
There are only 2 ways to get a sum that is a multiple of 3 :
Case 1: Both numbers are divisible by 3 . There are 4 numbers in the set that are divisible by 3 , thus there are ( 2 4 ) = 2 4 × 3 = 6 total possibilities for this case.
Case 2: One of the numbers leaves a remainder of 1 and the other leaves a remainder of 2 when divided by 3 . There are 5 numbers for each of the groups. Thus, by the rule of product, there are 5 × 5 = 2 5 total possibilities for this case.
In total there are ( 2 1 4 ) = 9 1 ways to pick 2 distinct numbers from the set. Therefore the probability that the sum is divisible by 3 is 9 1 6 + 2 5 = 9 1 3 1 . Hence a + b = 3 1 + 9 1 = 1 2 2 .