RMO 1993

1 9 93 1 3 99 19^{93}-13^{99} is divisible by

299 162 173 204

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.

2 solutions

Adarsh Kumar
Apr 12, 2014

This is how I did it:if you carefully notice the last two digits of the powers of 19 you will get the following pattern:19,49,79,09,39,69,99,29,59,89 and this will keep reapeating.From this we get that the last two digits of 19^93 are 79.Now,moving on to the last two digits of the powers of 13 to the power ofa no.which is a multiple of 3 you get the following pattern:97,17,37,57,77 and then it repeats.Which leads us to the conclusion that 13^99 will have 77 as its last two digits.Thus the last two digits of the no. in the question are 02.That implies that the number has to be 162.My God!!!!.

Slight correction to my above sol.the last two digits of 19^93 should be 99.the difference of the last two digits of 19^93 and 13^99 are 22. .

Adarsh Kumar - 7 years, 2 months ago

Write a comment or ask a question...

Adarsh Kumar - 7 years, 2 months ago

I don't get your approach ...

How did you do it ?

Amish Naidu - 7 years ago

How are you so sure that a number ending in 22 is divisble by 162? 822 ain't and so isn't 222 divisible by 162. Incorrect solution!

Krishna Ar - 6 years, 11 months ago
Saurabh Mallik
Apr 17, 2014

This problem can be solved through m o d mod function.

1 9 93 1 3 99 m o d 19^{93}-13^{99} mod 299 = 148 299 = 148 (Not divisible)

1 9 93 1 3 99 m o d 19^{93}-13^{99} mod 173 = 94 173 = 94 (Not divisible)

1 9 93 1 3 99 m o d 19^{93}-13^{99} mod 204 = 198 204 = 198 (Not divisible)

1 9 93 1 3 99 m o d 19^{93}-13^{99} mod 162 = 0 162 = 0 (Divisible)

Thus, the answer is 162 \boxed{162}

kya saurabh mod ki phd kiya kya?

manas verma - 7 years, 1 month ago

Log in to reply

Ha yaar, ye pataa nahi kaise mod itni aasaani se nikaal leta hai...

Satvik Golechha - 7 years, 1 month ago

Thanks! Would you like to vote my awesome solution guys.

Saurabh Mallik - 7 years, 1 month ago

Log in to reply

Not before you tell how you get the mod remainders sooooo fast

Satvik Golechha - 7 years ago

can you please explain what is this mod function in detail and in brief please

Saurav Sharma - 7 years, 1 month ago

what is mod function

Max B - 7 years, 1 month ago

Log in to reply

M o d Mod function is used to check whether a number is divisible by another or to find the remainder when one number is divided by another.

For example:

24 24 m o d mod 8 = 0 8 = 0 (Since, Remainder = 0 0 )

90 90 m o d mod 7 = 6 7 = 6 (Since, Remainder = 6 6 )

It is usually used to find the remainder when one number is divided by another.

Saurabh Mallik - 7 years ago

Log in to reply

What about this case (the question in hand)...

Amish Naidu - 7 years ago

How do you perform the m o d mod operation in these cases ?...

Amish Naidu - 7 years ago

how did u calculate it so accurate.... Even calculator was unable to do it

Vighnesh Raut - 7 years ago

why you have taken mod 299

Harshi Singh - 6 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...