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 1 3 7 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 q p , where p and q are coprime positive integers, find the last 3 digits of p + q .
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.
How would we find that 2 1 ⋅ 7 1 0 ⋅ 6 2 0 ≡ 5 0 4 ( m o d 1 0 0 0 ) and 1 3 3 0 ≡ 4 9 ( m o d 1 0 0 0 ) without a calculator?
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.
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 and a 2 ≡ b 2 m o d n , then a 1 a 2 ≡ b 1 b 2 m o d n .
We shall start with p = C 1 2 1 × 7 1 0 × 6 2 0 . First we prime factorize p into 7 1 1 × 3 2 1 × 2 2 0 . So, 7 1 1 × 3 2 1 × 2 2 0 ≡ k m o d 1 0 0 0 .
7 3 ≡ 3 4 3 m o d 1 0 0 0 , 3 7 ≡ 1 8 7 m o d 1 0 0 0 , 2 1 0 ≡ 2 4 m o d 1 0 0 0
7 4 ≡ 4 0 1 m o d 1 0 0 0 , ( 3 7 ) 3 ≡ 1 8 7 3 m o d 1 0 0 0 , ( 2 1 0 ) 2 ≡ 5 7 6 m o d 1 0 0 0
( 7 4 ) 2 × 7 3 ≡ ( 4 0 1 ) 2 ( 4 0 1 ) m o d 1 0 0 0
So, the last 3 digits of ( 3 4 3 ) ( 4 0 1 ) 2 is 7 4 3 , 1 8 7 3 is 2 0 3 and 5 7 6 . Therefore, the last 3 digits of p is k = 7 4 3 × 2 0 3 × 5 7 6 ≡ 5 0 4 m o d 1 0 0 0 .
Now, we have to find last 3 digits of 1 3 3 0 . 1 3 5 ≡ 2 9 3 m o d 1 0 0 0 ( 1 3 5 ) 2 ≡ 8 4 9 m o d 1 0 0 0 ( ( 1 3 5 ) 2 ) 3 ≡ 4 9 m o d 1 0 0 0
Finally, using the additive property of modular arithmetic, we can finally find the last 3 digits of p + q ≡ 5 0 4 + 4 9 m o d 1 0 0 0 . Therefore the last 3 digits is 5 0 4 + 4 9 = 5 5 3 .
Log in to reply
Now its better to understand, Please correct some typing errors. (7^4)^2 * 7^3 = (401)^2 * (343) mod 1000
How you got 504 and 49. I could not get these values even using MS excel :)
i didn't get dis... pls help me to understand "the concept of mod".
Notice that the given problem models the binomial probability distribution Bin ( 3 0 , 7 / 1 3 ) .
Problem Loading...
Note Loading...
Set Loading...
We let 1 represent the probability of answering the question correct and 0 represent the probability of answering the question incorrect. Since Bob answered 10 questions correctly in a row, therefore the binary sequence is ( 1 1 1 1 1 1 1 1 1 1 ) 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 . 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 = 1 3 3 0 C 1 2 1 × 7 1 0 × 6 2 0 = q p
So, in order to find the last 3 digits of p = C 1 2 1 × 7 1 0 × 6 2 0 and q = 1 3 3 0 , we find the remainder when divided by 1 0 0 0 . Since 2 1 × 7 1 0 × 6 2 0 ≡ 5 0 4 m o d 1 0 0 0 and 1 3 3 0 ≡ 4 9 m o d 1 0 0 0 , hence our desired answer is 5 0 4 + 4 9 = 5 5 3 .