Three persons play the following game: a subset with elements of the set is selected randomly, all selections having the same probability. The winner is or according to whether the sum of the elements of the selected subset is congruent to or modulo . Which of the values listed for gives an equal probability of winning?
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.
Lemma: If p is a prime number and a 0 , a 1 , . . . , a p − 1 are rational numbers satisfying a 0 + a 1 ϵ + a 2 ϵ 2 + . . . + a p − 1 ϵ p − 1 = 0 , where ϵ = e p 2 π i , that is the primitive root of unity, then a 0 = a 1 = a 2 = . . . = a p − 1 .
Proof:
Observe that a 0 + a 1 x + a 2 x 2 + . . . + a p − 1 x p − 1 and 1 + x + x 2 + . . . + x p − 1 are not relatively prime since they have a common root. Since the latter is irreducible over Q , 1 + x + x 2 + . . . + x p − 1 must divide a 0 + a 1 x + . . . + a p − 1 x p − 1 . which can only happen if a 0 = a 1 = . . . = a p − 1 . We have proven the lemma.
Denote a k ( j ) to be the number of k element subsets such that the sum of the elements is congruent to j modulo 3 . We will also define ϵ = e 3 2 π i .
It is pretty clear that j = 0 ∑ 2 a k j ϵ j = 1 ≤ c 1 < c 2 < . . . < c k ≤ 1 9 8 6 ∑ ϵ c 1 + c 2 + . . . + c k since they are both counting the same thing. However, notice that the right hand side is the x 1 9 8 6 − k coefficient of A = ( x + ϵ ) ( x + ϵ 2 ) . . . ( x + ϵ 1 9 8 6 ) . We know that x 3 + 1 = ( x + ϵ ) ( x + ϵ 2 ) ( x + ϵ 3 ) , so we can greatly simplify the product A = ( x 3 + 1 ) 6 6 2 Thus, we can find the x 1 9 8 6 − k coefficient. Notice that if the coefficient of the x 1 9 8 6 − k term is t , then we know that by the lemma, one of the below cases must be fulfilled a k ( 0 ) − t a k ( 0 ) a k ( 0 ) = a k ( 1 ) = a k ( 2 ) = a k ( 1 ) − t = a k ( 2 ) = a k ( 1 ) = a k ( 2 ) − t However, we want to find the k where a k ( 0 ) = a k ( 1 ) = a k ( 2 ) . Clearly, this occurs when the x 1 9 8 6 − k coefficient is zero. Now notice that in A , there only exist terms with exponents divisible by three. That means that the coefficient is zero whenever 3 ∤ k and the only value that follows that condition among the answer choices is 6 0 0 2 .