Find the smallest integer x > 1 5 satisfying x x ≡ 1 5 ( m o d 7 7 ) ≡ 1 5 ( m o d 2 8 6 ) .
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.
exact solution +(1)
We have 2 8 6 = 1 1 . 2 6 & 7 7 = 1 1 . 7 .
LCM of7 & 26 is 182.
So LCM of 286 & 77 is 11.182 = 2002 which both 286 & 77 divides.
So the least number leaving remainder 15 is 2 0 0 2 + 1 5 = 2 0 1 7 .
Nice!.. noticing about the LCM!
I used Chinese Remainder Theorem
Can you show how?😀
Consider that in the space of possible solutions we will want the lowest common multiple of 77 and 286 that is less than this number by 15. As we can interpret x congruent to 15 in under modulo 77 as all the multiples of 77 plus 15, the same can be said for the second equation. This leads back to the first statement I made.
L C M ( 7 7 , 2 8 6 ) + 1 5 = 2 0 1 7
Go Cubs! And to the end of the Billy Goat Curse!
As a fan you are no doubt familiar with the Cubs' unofficial motto , which could have given you a clue to the answer.
Log in to reply
I'm not really a fan, I just like seeing a team who struggles the good struggle pull it out.
Great problem! Thanks for sharing!
LCM(77,286)=7×11×26=2002. x is equivalent to 15 mod(2002) as well.which implies that x=2002q+15 for some integer q.Therefore the lowest possible value of x such that x>15 is x=2002×1+15=2017. So the final answer is 2017.
Problem Loading...
Note Loading...
Set Loading...
Representing x in the form of 77 as 7 7 a + 1 5 for a ≥ 0 .
Representing x in the form of 286 as 2 8 6 b + 1 5 for b ≥ 0 .
Now equating both we get:
7 7 a + 1 5 = 2 8 6 b + 1 5 7 a = 2 6 b
Now when a = 0 we get x = 1 5 but x > 1 5 and 2 6 ∣ a so a = 2 6 and x = 2 0 1 7 .