Probability and Divisibility

Albert, Ben and Charles each writes randomly an integer which is within [ 1 , 19 ] [1,19] . What is the probability that the sum of three written numbers is divisible by 3 3 ?

109 323 \frac { 109 }{ 323} 2539 6859 \frac { 2539 }{ 6859 } 1027 6859 \frac { 1027 }{ 6859 } 2287 6859 \frac { 2287 }{ 6859 }

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.

3 solutions

Brian Moehring
Jun 29, 2018

Considered modulo 3 3 , each person can draw a number with residue 0 0 with probability 6 19 \frac{6}{19} , a number with residue 1 1 with probability 7 19 \frac{7}{19} , and a number with residue 2 2 with probability 6 19 \frac{6}{19} . It follows that the generating function for the probabilities of these residues is 1 19 ( 6 + 7 x + 6 x 2 ) \frac{1}{19}\left(6+7x+6x^2\right)

Therefore the sum of their residues has generating function ( 1 19 ( 6 + 7 x + 6 x 2 ) ) 3 = n = 0 6 a n x n , \left(\frac{1}{19}\left(6+7x+6x^2\right)\right)^3 = \sum_{n=0}^6 a_n x^n, which is a degree 6 6 polynomial. Therefore we just need to find the sum a 0 + a 3 + a 6 a_0 + a_3 + a_6 .

We can easily find a 0 = a 6 = 6 3 1 9 3 a_0 = a_6 = \frac{6^3}{19^3} and using the fact 3 = 2 + 1 + 0 = 1 + 1 + 1 3 = 2+1+0 = 1+1+1 and these are the only two partitions of 3 3 using 0 , 1 , 2 0,1,2 , we can find a 3 = 1 1 9 3 ( 7 3 + 3 ! ( 6 ) ( 7 ) ( 6 ) ) a_3 = \frac{1}{19^3} \left(7^3 + 3! \cdot (6)(7)(6)\right)

Adding these, we find the probability is 1 1 9 3 ( 6 3 + 7 3 + 3 ! ( 6 ) ( 7 ) ( 6 ) + 6 3 ) = 2287 6859 \frac{1}{19^3}\left(6^3 + 7^3 + 3!(6)(7)(6) + 6^3\right) = \boxed{\frac{2287}{6859}}


An alternate method to calculate a 0 + a 3 + a 6 a_0+a_3+a_6 :

We can also set x = e 2 π i / 3 x=e^{2\pi i/3} to note that 1 1 9 3 ( 6 + 7 e 2 π i / 3 + 6 e 4 π i / 3 ) 3 = ( a 0 + a 3 + a 6 ) + ( a 1 + a 4 ) e 2 π i / 3 + ( a 2 + a 5 ) e 4 π i / 3 \frac{1}{19^3}\left(6+7e^{2\pi i/3} + 6e^{4\pi i/3}\right)^3 = (a_0+a_3+a_6) + (a_1+a_4)e^{2\pi i/3} + (a_2+a_5)e^{4\pi i/3} and then evaluating the left-hand side by using 1 + e 2 π i / 3 + e 4 π i / 3 = 0 1+e^{2\pi i/3} + e^{4\pi i/3} = 0 : 1 1 9 3 ( 6 + 7 e 2 π i / 3 + 6 e 4 π i / 3 ) 3 = 1 1 9 3 ( e 2 π i / 3 ) 3 = 1 1 9 3 = ( 1 1 9 3 + t ) + t e 2 π i / 3 + t e 4 π i / 3 \frac{1}{19^3}\left(6+7e^{2\pi i/3} + 6e^{4\pi i/3}\right)^3 = \frac{1}{19^3}\left(e^{2\pi i/3}\right)^3 = \frac{1}{19^3} = \left(\frac{1}{19^3} + t\right) + te^{2\pi i/3} + te^{4\pi i/3}

Then since the coefficients are probabilities, it follows that 1 = ( 1 1 9 3 + t ) + t + t = 1 1 9 3 + 3 t t = 1 3 ( 1 1 1 9 3 ) = 2286 6859 1 = \left(\frac{1}{19^3} + t\right) + t + t = \frac{1}{19^3} + 3t \implies t = \frac{1}{3}\left(1 - \frac{1}{19^3}\right) = \frac{2286}{6859} so that a 0 + a 3 + a 6 = 1 1 9 3 + 2286 6859 = 2287 6859 a_0+a_3+a_6 = \frac{1}{19^3} + \frac{2286}{6859} = \boxed{\frac{2287}{6859}}

Jc 506881
Jul 1, 2018

You can count the ways of rolling a total of n n with three 19-sided dice by looking at the coefficient of x n x^n in the polynomial ( x + x 2 + + x 19 ) 3 (x + x^2 + \dots + x^{19})^3 . Wolfram will happily expand this polynomial for you, allowing you to read off the coefficients of the x 3 k x^{3k} terms, which are: 1, 10, 28, 55, 91, 136, 190, 235, 262, 271, 262, 235, 190, 136, 91, 55, 28, 10, 1. Summing this up gives a total of 2287 ways of rolling a multiple of three. Divide by the total number of outcomes, 1 9 3 = 6859 19^3 = 6859 , for the probability.

This solution is similar to Brian's, but his is more clever because he used some modular arithmetic to simplify the polynomial whereas I just let a computer do all the work.

Let Albert choose number a a , Ben choose number b b and Charles choose number c c .

Then for a + b + c a + b+ c to be divisible by 3 , there are following three cases :

Case 1 : All the three numbers a a , b b , c c are divisible by 3.

Case 2 : Only one of them is divisible by 3 and sum of other two is divisible by 3.

Case 3 : No number is divisible by 3.

Case 1 : In the interval [0, 19] there are 6 integers that are divisible by 3.

P ( all the three numbers are divisible by 3 ) = ( 6 19 ) 3 P(\text{all the three numbers are divisible by 3}) = \bigg(\large\frac{6}{19}\bigg)^3

Case 2 : Let 3 a 3 \mid a and 3 ( b + c ) 3 \mid (b + c) with 3 b 3 \nmid b and 3 c 3 \nmid c .

We know any integer that is not divisible by 3 is of the form 3 m + 1 3m+1 or 3 m + 2 3m+2 . Taking b b and c c from 3 m + 1 3m+1 form or from 3 m + 2 3m+2 form will not get us 3 ( b + c ) 3\mid (b+c) . So one number should be of each form i.e. either b b is of the 3 m + 1 3m+1 form & \& c c is of 3 m + 2 3m+2 form or b b is of 3 m + 2 3m+2 form & \& c c is of 3 m + 1 3m+1 form. There are 7 numbers of the form 3 m + 1 ) 3m + 1) and 8 numbers of the form 3 m + 2 ) 3m+2) in the interval [0, 19].

P ( 3 a P(3 \mid a and 3 ( b + c ) 3 \mid (b+c) with 3 b 3 \nmid b and 3 c ) = 6 19 6 19 7 19 + 6 19 7 19 6 19 = 2 6 2 7 1 9 3 3 \nmid c) = \LARGE\frac{6}{19}\cdot\frac{6}{19}\cdot\frac{7}{19} + \frac{6}{19}\cdot\frac{7}{19}\cdot\frac{6}{19} = \frac{2\cdot6^{2}\cdot7}{19^3}

But b b or c c can also take place of a a

So, P ( C a s e 2 ) = 3 2 6 2 7 1 9 3 \large P(Case 2) = 3\cdot\frac{2\cdot6^2\cdot7}{19^3}

Case 3 : Either all 3 numbers are of the form 3 m + 1 3m+1 or all of them is of 3 m + 2 3m+2 form. This condition must be satisfied for a + b + c a+b+c to be divisible by 3.

P ( C a s e 3 ) = ( 6 19 ) 3 + ( 7 19 ) 3 P(Case 3) = \bigg(\large\frac{6}{19}\bigg)^3 + \bigg(\large\frac{7}{19}\bigg)^3

Adding all the partial probability we get,

P ( 3 ( a + b + c ) ) = 6 3 + 6 3 7 + 6 3 + 7 3 1 9 3 = 2287 6859 P(3\mid(a+b+c)) = \LARGE\frac{6^3 + 6^3\cdot7 + 6^3 + 7^3}{19^3} = \boxed{\frac{2287}{6859}}

I used process of elimination, I calculated that 1027 and the first choice were too low, and that 2589 is too high, and so one answer left

Sanchit Sharma - 2 months, 2 weeks ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...