Random Answer, Correct!

Bob wants to keep a good-streak on Brilliant, so he logs in each day to Brilliant in the month of June. But he doesn't have much time, so he selects the first problem he sees, answers it randomly and logs out, despite whether it is correct or incorrect.

Assume that Bob answers all problems with 7 13 \frac{7}{13} probability of being correct. He gets only 10 problems correct, surprisingly in a row, out of the 30 he solves. If the probability that happens is p q \frac{p}{q} , where p p and q q are coprime positive integers, find the last 3 3 digits of p + q p+q .


The answer is 553.

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.

1 solution

Shaun Loong
Mar 26, 2014

We let 1 1 represent the probability of answering the question correct and 0 0 represent the probability of answering the question incorrect. Since Bob answered 10 questions correctly in a row, therefore the binary sequence is ( 1111111111 ) 00000000000000000000 (1111111111)00000000000000000000 . This is known as the bijection principle. With this, it is easy to compute the probability of the event that probability Bob solve 10 in a row is P = C 1 21 × 7 10 × 6 20 1 3 30 = p q P=\frac{C_{1}^{21}\times7^{10}\times6^{20}}{13^{30}}=\frac{p}{q}

So, in order to find the last 3 digits of p = C 1 21 × 7 10 × 6 20 p=C_{1}^{21}\times7^{10}\times6^{20} and q = 1 3 30 q=13^{30} , we find the remainder when divided by 1000 1000 . Since 21 × 7 10 × 6 20 504 m o d 1000 21\times7^{10}\times6^{20}\equiv 504 \mod 1000 and 1 3 30 49 m o d 1000 13^{30}\equiv 49 \mod 1000 , hence our desired answer is 504 + 49 = 553 504+49=\boxed{553} .

How would we find that 21 7 10 6 20 504 ( m o d 1000 ) 21 \cdot 7^{10} \cdot 6^{20} \equiv 504 \pmod{1000} and 1 3 30 49 ( m o d 1000 ) 13^{30} \equiv 49 \pmod{1000} without a calculator?

Hahn Lheem - 7 years, 2 months ago

Log in to reply

I spent some time on that but got tired of it and went for wolfram. If it had asked for the last 2 digits it would have been a lot easier.

Kevin Bourrillion - 7 years, 1 month ago

In this question, I used the calculator to make my work less tedious. You can choose to work without a calculator, but it would take a lot of time. We use the multiplicative property of modular arithmetic such that if a 1 b 1 m o d n a_{1}\equiv b_{1} \mod n and a 2 b 2 m o d n a_{2}\equiv b_{2} \mod n , then a 1 a 2 b 1 b 2 m o d n a_{1}a_{2}\equiv b_{1}b_{2} \mod n .

We shall start with p = C 1 21 × 7 10 × 6 20 p=C_{1}^{21}\times7^{10}\times6^{20} . First we prime factorize p p into 7 11 × 3 21 × 2 20 7^{11}\times3^{21}\times2^{20} . So, 7 11 × 3 21 × 2 20 k m o d 1000 7^{11}\times3^{21}\times2^{20}\equiv k \mod 1000 .

7 3 343 m o d 1000 7^{3}\equiv 343 \mod 1000 , 3 7 187 m o d 1000 3^{7}\equiv 187 \mod 1000 , 2 10 24 m o d 1000 2^{10}\equiv 24 \mod 1000

7 4 401 m o d 1000 7^4\equiv 401 \mod 1000 , ( 3 7 ) 3 18 7 3 m o d 1000 (3^{7})^{3}\equiv 187^{3} \mod 1000 , ( 2 10 ) 2 576 m o d 1000 (2^{10})^{2}\equiv 576 \mod 1000

( 7 4 ) 2 × 7 3 ( 401 ) 2 ( 401 ) m o d 1000 (7^{4})^{2}\times7^{3}\equiv (401)^{2}(401) \mod 1000

So, the last 3 digits of ( 343 ) ( 401 ) 2 (343)(401)^{2} is 743 743 , 18 7 3 187^{3} is 203 203 and 576 576 . Therefore, the last 3 3 digits of p p is k = 743 × 203 × 576 504 m o d 1000 k=743\times203\times576\equiv \boxed{504} \mod 1000 .

Now, we have to find last 3 3 digits of 1 3 30 13^{30} . 1 3 5 293 m o d 1000 13^{5}\equiv 293 \mod 1000 ( 1 3 5 ) 2 849 m o d 1000 (13^{5})^{2}\equiv 849 \mod 1000 ( ( 1 3 5 ) 2 ) 3 49 m o d 1000 ((13^{5})^{2})^{3}\equiv \boxed{49} \mod 1000

Finally, using the additive property of modular arithmetic, we can finally find the last 3 3 digits of p + q 504 + 49 m o d 1000 p+q\equiv 504+49 \mod 1000 . Therefore the last 3 3 digits is 504 + 49 = 553 504+49=\boxed{553} .

Shaun Loong - 7 years, 2 months ago

Log in to reply

Now its better to understand, Please correct some typing errors. (7^4)^2 * 7^3 = (401)^2 * (343) mod 1000

Hari Om Swarnkar - 7 years, 2 months ago

Log in to reply

Alright, it has been edited :)

Shaun Loong - 7 years, 2 months ago

How you got 504 and 49. I could not get these values even using MS excel :)

Hari Om Swarnkar - 7 years, 2 months ago

Log in to reply

Wolfram Alpha is your friend :)

Oliver Bel - 7 years, 2 months ago

i didn't get dis... pls help me to understand "the concept of mod".

Shashank Gour - 7 years, 2 months ago

Notice that the given problem models the binomial probability distribution Bin ( 30 , 7 / 13 ) \textrm{Bin}(30,7/13) .

Prasun Biswas - 4 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...