remainder problems
find remainder when a^m+b^n is divided by k
a,b,m,n,k are natural
in this can i do
remainder of (remainder of (a^m)/k + remainder of (b^n)/k ) / k
23 Replies
jaise 2222^5555 + 5555^2222 divided by 7 mein 2222^5555 se 7 ka remainder + 5555^2222 ka remainder
then jo sum aaya usko wapis 7 se divide karo
@Apu
Note for OP
+solved @user1 @user2... to close the thread when your doubt is solved. Mention the users who helped you solve the doubt. This will be added to their stats.its true only ig
Yup
$(a^{m}+b^{n})modk = (a^{m}modk+b^{n}modk)modk$
Opt
have u studied congruency of numbers btw ??
can u tell other topics which are mainly olympiad focused which can be help in jee too
like euler's totient , congruency etc
Stuff like euler's function and fermat little theorem, chinese remainder theorem, wilson's theorem
do u have some list or smthing
or just list em down mostly NT ke topics hi hai
Well these are the only things I have seen being applied in jee math. (also oly. math)
do u have notes of all these topics ??
Yep I do have short notes for those.
can u pls share them whenever u can
Euler Totient Function, Euler's Theorem on the same, and FLT are important yeah. CRT and Wilson's, eh. They don't ask for solutions to systems of linear congruences, so not that useful.
Sometimes one has to solve linear congruencies in intermediate steps, so it is good to have an idea of crt.
I haven't seen anything of the sort yet in PYQs, but then again, I haven't exactly solved a lot of them either. So maybe.
@SirLancelotDuLac pls dm notes 🙏
Yeah, I'll try to do that by today.
alr thanx
Pls share with me as well if that's possible.
Okie.
+solved @SirLancelotDuLac @Opt
Post locked and archived successfully!
Archived by
<@741159941934415883> (741159941934415883)
Time
<t:1738505092:R>
Solved by
<@1075951732460376214> (1075951732460376214), <@763645886500175892> (763645886500175892)