< dump to. vie Home » Forums » CAT 2018 Quant Lessons » Module Arithmetic 8€" Remainder Theory ‘Search founs |@ Display replies ft, with oldest frst This extremely useful article for fining remainders has been contributed to 1G by Fundeo Bond, another Intelligent TG te. All the CAT 2007/2008 who find this article useful are requested to say thanks 20 Fundoo Bond for his efforts and this wonderful complltion, f you have some interesting article, funda or help Information to share, please mal itto us and ws millpost i by your name- Tota! Gagha ‘The problems of finding the remainder are considered Foreunately, If we arm ourselves with some basic U problems Into sit We most dreadful among the number theory problems. ‘orems, we will see that we can turn these mind-boggling Sand can ensure some easy marks, 1 willbe trying to share both the theory and the examples in order to meke the concepts clearer, Again friends, do keep In mind that 1 fam nota genius to write these theavems on my awa, 1 have learnt them from various sources and 1 am trying my best to explain you inmy own words. Euler’s Theorem wy) oo TF M and N are two numbers conrime to each othe , 1s HCFLM.N) = and N= aPBPC..., Remain where oy -ne-De-D- pee dis known as Euler's Totent function. «(N) is also the number of numbers less then Find the rei der when 5% is divided by 63. Answer: 5 and 63 are coprime to each other, therefore we can apply Euler’s theorem here. 63 = 37x 7 463) -6a1-Ha-t)-18 318. 38 (1-1 Remainder 2 3 37 5305 ~ 1 = Romainder[=] - Remainder —— ‘Therefore, Re: ner Find the last three digits of 57%, answer: Many a times (not always), the quicker way to calculate the last three digits is to calculate the remainder by 1 000. We can see that §7 and 1 000 are coprime to each other, Therefore, we can use Euler's theorem here if it’s useful 1.000 = 2*~ 5* = (1000) yg 2 s000(1-4y¢1-4) a= a-H Therefore, 37 1000 400, A400 , 57400, Remainder 5 1 2 = Remaincert=2 A 57802 1000 = Remainder Hence, the last two digits of $7 are 249, Fermat's Little Theorem JF N in the above Euler's theorem is a prime number, then#(N)=NI-=) =N-1. Therefore, iF M and N are 4 coprime to each other and Mis prime number, Remaindert™ —]=1Fina the remainaer wnen 92° 1s aiviaea by 44. Answer: 21 is 2 prime number therefore ¢(N) = 30. 52 and 21 are prime to each other. Therefore, by Fermat's theorem: 239 Remaindet== =1> Remainga Wilson's Theorem TF Pis a prime number then Remainder =2**)-0, tn other words, (P— 1)! + 1 is divisible by Pif Pis a prime number. It also means thet the remainder when (P — 4)! Is divided by Pis P— 1 when Pis prime. Find the remainder when 401 Is divided by 41. Answer By Wins theorem, we can soe that 40! + 1 is divisible by 41 = Remainder Find the remainder when 391 is divided by 41. Answer: In the above example, we saw that the remainder when 40! is divided by 41 is 40. > 40! = 41k + 40 > 40 x 39! = 42k ~ 40. The R.HS. gives remainder 40 with 41 therefore L.H.S. should also give remainder 40 with 41. LH.S. = 40 x 39! where 40 gives remainder 40 with 41. Therefore, 39! should give remainder 1 with 41. a ese Remainder Theorem This is 2 very useful result, It might take a little time to understand and master Chinese remainder theorem completely but once understood, it is an asset. Tra number N= a+b, where sand bare prime to ach other Le, hla, By = 1, and Wis a number such that seraindet!} = and kersindet) =m ten Romande Remainder(====— So final remainder is (5 + 2) divide by 7 Find the remainder when 8% is divided by 132. jote that here 8 and 232 are not coprime as HCF (8, 132) = 4 and not 1. Therefore, we cannot apply Eular’s theorem cire: