Chinese Remainder Theorem

3/1/2014
MBA| CAT| CAT 2013| CAT 2014| CAT Online| MBA 2013| MBA 2014| MBA Entrance Exams| CAT Test| Preparation| CAT Questions
<
Jump to...
>
Home
Forums
CA T 2014 Quant Lessons
Modulo A rithmetic Remainder Theory
Search forums
haGat Delhi & Noida!

Display replies flat, with oldest first
Modulo A rithmetic Remainder Theory by fundo o bo nd - Frida y, 28 Se pte m be r 2007, 03:18 AM
This extremely useful article for finding remainders has been contributed to TG by Fundoo Bond, another intelligent TGite. All the C AT 2007/2008 who find this article useful are requested to say thanks to Fundoo Bond for his efforts and this wonderful compilation. If you have some interesting article, funda or helpful information to share, please mail it to us and we will post it by your name- Total Gadha
The problems of finding the remainder are considered the most dreadful among the number theory problems. Fortunately, if we arm ourselves with some basic theorems, we will see that we can turn these mind-boggling problems into sitters and can ensure some easy marks. I will be trying to share both the theory and the examples in order to make the concepts clearer. Again friends, do keep in mind that I am not a genius to write these theorems on my own. I have learnt them from various sources and I am trying my best to explain you in my own words.
http://totalgadha.com/mod/forum/discuss.php?d=1369
1/50
3/1/2014
2/50
3/1/2014
3/50
3/1/2014
R eply
Re: Modulo A rithmetic Remainder Theory by R ishi Ka po o r - Frida y, 28 Se pte m be r 2007, 05:06 AM
Thanks Sir...This is what I was searching for...and you have given it in the best time... You are really TG.....Toooooooo Gooooood with these Fundoo theorams, you have proved yourself BOND
S how parent | R eply
Re: Modulo A rithmetic Remainder Theory by Ma dy Ahm e d - Frida y, 28 Se pte m be r 2007, 05:36 AM wo w,fa bulo us, fa nta stic,m ind blo wing,e x ce lle nt ...wo rds a re sho rt o f m y dictio na ry to pra ise u tha nx a lo t
Re: Modulo A rithmetic Remainder Theory by shya m Sunda r - Frida y, 28 Se pte m be r 2007, 08:46 AM he y fo lk s ho w to do 40!%83
Re: Modulo A rithmetic Remainder Theory by AD P - Frida y, 28 Se pte m be r 2007, 09:25 AM
corollary of the Wilson theorem

which will be ve ry use ful whe n so lving re m a inde r pro ble m s. Fro m W ilso n the o re m , we ha ve (p-1)!%p = (p-1) o r -1----(1) fro m (1) we ca n sa y (p-2)!%p = 1
Re: Modulo A rithmetic Remainder Theory by AD P - Frida y, 28 Se pte m be r 2007, 09:43 AM He y Shya m Sunde r So lutio n to ur pro ble m 40! m o d 83 W e k no w tht--frm W ilso n's T he o re m (p-1)!%p = (p-1) o r -1(iff p is prim e ) so , we ca n de duce 82!%83=-1 o r 82---------------(1) frm W ilso n's C o ro lla ry (p-2)!%p = 1 so , we ca n de duce he re 81!%83=1-----------------(2) No w 81!=81.80.79.-------.42.41!----------(3) fro m 2 a nd 3 (81.80.79.--------.42.41!)%83=1 -2*-3*-4*-5....-41*41! = 41!*41!%83 = (41!)^2%83 = 1 which is po ssible o nly whe n 41! m o d 83=1 be ca use the re a re e ve n no o f te rm s so ne ga tive sign go t ca nce lle d No w we ha ve 41!m o d83=1 (41.40!)%83=1 (-42.40!)%83=1 suppo se 40!=x (-42*x )%83=1 which is po ssible o nly whe n x be co m e s -2 o r 81 so a ns is 81
Re: Modulo A rithmetic Remainder Theory by subha de e p da s - Frida y, 28 Se pte m be r 2007, 09:43 AM
4/50
3/1/2014
ho w to so lve (i) find the re m a inde r o f 55555 .... 93 tim e s divide d by 98 (ii) re m a inde r o f 2 ^1990 / 1990
Re: Modulo A rithmetic Remainder Theory by AD P - Frida y, 28 Se pte m be r 2007, 09:50 AM ho w to so lve (ii) re m a inde r o f 2 ^1990 / 1990 1990=2.5.199 fro m Eule r's T he o re m phi(2)=1 phi(5)=4 phi(199)=198 2^4=1 m o d 5--------(1) 2^198=1 m o d 199---------(2) LC M(4,198)=396 so 2^396=1 m o d 1990 2^1980=1 m o d 1990(be ca use 1980 is a m ultiple o f396) so no w we re m a in with 2^10 m o d 1990 1024 m o d 1990=1024 a ns is 1024
Re: Modulo A rithmetic Remainder Theory by la vik a gupta - Frida y, 28 Se pte m be r 2007, 09:51 AM hi Mr. Fundo o Bo nd. this is a m a ste rpie ce 2 le a rn the co nce pts o f re m a inde r the o re m .i fo und the chine se re m a inde r the o re m a bit m o re a bstruse 2 m a ste r,ye t o the r the o re m s a nd the ir e nuncia tio n with e x a m ple s pro ve d re a lly he lpful 2 m e .ho pe 2 se e such gre a t wo rk a ga in fro m u. HAT S O FF T O U
Re: Modulo A rithmetic Remainder Theory by C a ta pult!!! O n the wa y - Frida y, 28 Se pte m be r 2007, 09:58 AM Hi Fundo o Bo nd!!! Just o ne wo rd.. "Supe rb"..
Re: Modulo A rithmetic Remainder Theory by AD P - Frida y, 28 Se pte m be r 2007, 10:13 AM (i) find the re m a inde r o f 55555 .... 93 tim e s divide d by 98 98=2.7.7 It is cle a r tha t the give n no give s re m a inde r o f 11.....11 93 tim e s whe n divide d by 2 so no w que stio n re m a ins (5555....55 93 tim e s) m o d 49 55555.......55 93 tim e s =5x 10^92+5x 10^51+--------+5 =5[10^0+10^1+--------+10^92] =5[(10^93-1)/9] =5[(11111111111111....11 92 tim e s)] I think a ns is 5 plzz che ck it o ut
Re: Modulo A rithmetic Remainder Theory by jite ndra ha va lda r - Frida y, 28 Se pte m be r 2007, 10:23 AM Hi T G, re a lly a n unbe lie va ble a rticle to sa y the le a st .... C o ntinue yo ur go o d wo rk ... T ha nk s, Jite ndra
5/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by T o m Go e l - Frida y, 28 Se pte m be r 2007, 10:36 AM hi fundo o , T ho ugh we a ll k no w yo u a re a fundo o a nd a bo nd.....by sha ring this a rticle to ha ve sho wn a ltruistic cha ra cte r.Ha ts o ff to yo u. T ha nk s Am it
Re: Modulo A rithmetic Remainder Theory by Sa nju P - Frida y, 28 Se pte m be r 2007, 11:03 AM Hi Fundo o , W o nde rful a rticle a nd gre a t co m pila tio n! T ha nk s! S P
Re: Modulo A rithmetic Remainder Theory by So ftwa re Engine e r - Frida y, 28 Se pte m be r 2007, 11:18 AM FB Ma rve lo us Me tho ds ! ! ! T ha nk s, SE
Re: Modulo A rithmetic Remainder Theory by purvi ve rm a - Frida y, 28 Se pte m be r 2007, 12:18 P M fa bulo us is the wo rd.....ple a se po st so m e m o re funda s re la te d to num be rs.
Re: Modulo A rithmetic Remainder Theory by a nk it ha rish - Frida y, 28 Se pte m be r 2007, 12:32 P M Awe so m e C o m pila tio n.T ha nk s a lo t bo nd
Re: Modulo A rithmetic Remainder Theory by fundo o bo nd - Frida y, 28 Se pte m be r 2007, 12:40 P M Hi T G n a ll T Gite s, T ha nk s a lo t fo r a ll the a ppe ricia tio n....Fe e ling gre a t tha t m y e ffo rts a re a ppe ricia te d...And it give s a grt jo y tha t the a rticle wa s publishe d e x a ctly a s it wa s subm itte d re ga rds, fundo o
...
Re: Modulo A rithmetic Remainder Theory by Da gny T a gga rt - Frida y, 28 Se pte m be r 2007, 01:20 P M Kudo s Fundo o
Re: Modulo A rithmetic Remainder Theory by T o ta l Ga dha - Frida y, 28 Se pte m be r 2007, 01:55 P M
6/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by SS VV - Frida y, 28 Se pte m be r 2007, 03:01 P M i'm sure u wo nt be lie ve it ...but wa s just go ing to po st a re que st to yo u a sk ing yo u to e x pla in the se ve ry sa m e the o re m s ....ha d se e n the m in o ne o f yo ur po st whe re in tg m e ntio ne d the se a re yo ur fa vo urite to pics:> se co ndly wa nte d to tha nk yo u fo r a ll yo ur pre vio us po sts...u re a lly to o k grt pa ins in e x pla ing a ll yo ur m e tho ds in de ta il( re m e m be r the o ne in which i a sk e d fo r digita l ro o t a nd yo u type d up the de ta ile d a ppro a ch) a nd no w this....wht ca n i sa y but 'ro ck o n dude ' che e rs!!
Re: Modulo A rithmetic Remainder Theory by im ra n k ha n - Frida y, 28 Se pte m be r 2007, 03:58 P M u guyz a re jus fa nta bulo us.............tha nx a to n......go d ble ss ur spe cie s............ .
Re: Modulo A rithmetic Remainder Theory by Ma nish Ka shya p - Frida y, 28 Se pte m be r 2007, 04:51 P M Hi Fundo o , Its re a lly supe rb.O nly o ne thing I ca n sa y "Fundo o ". T ha nk s a nd R e ga rds, Ma nish
Re: Modulo A rithmetic Remainder Theory by Shubha ga ta ro y - Frida y, 28 Se pte m be r 2007, 07:00 P M binda ssss............ re m o f 7^115 divide d by 114??
Re: Modulo A rithmetic Remainder Theory by Abhra C ha tte rje e - Frida y, 28 Se pte m be r 2007, 07:25 P M W o nde rful jo b Bo nd ..... P le a se po st so m e thing o n P e rm uta tio n a nd P ro ba bility.
Re: Modulo A rithmetic Remainder Theory by Avia to r D - Frida y, 28 Se pte m be r 2007, 07:29 P M
hi fb, First, thank you for the post. It is very helpful. In the ques. : how to solve (ii) remainder of 2 ^1990 / 1990 1990=2.5.199 from Euler's Theorem phi(2)=1 phi(5)=4 phi(199)=198 2^4=1 mod 5--------(1) 2^198=1 mod 199---------(2) LCM(4,198)=396 so 2^396=1 mod 1990 2^1980=1 mod 1990(bec ause 1980 is a multiple of396) so now we remain with 2^10 mod 1990 1024 mod 1990=1024 ans is 1024 how c an we apply uler's theorem in this c ase? bec ause ac c ording to ur post we c an only use the theorem when both M(=2) and N(=1990) are c oprimes, but this not the c ase here.
http://totalgadha.com/mod/forum/discuss.php?d=1369 7/50
3/1/2014
Kindly elaborate.
Re: Modulo A rithmetic Remainder Theory by De e p Agra wa l - Frida y, 28 Se pte m be r 2007, 07:55 P M 7^115 / 114. P hi(114) = 66 he nce 7^66 / 114 = 1 R e m a ining is 7^49 /114 => ((7^3)^16 * 7) / 114 = 1^16 * 7 / 114 = 7 (Since , 7^3 = 343 => 343/114 = 1)
Re: Modulo A rithmetic Remainder Theory by ro hit a va sthi - Frida y, 28 Se pte m be r 2007, 08:30 P M he y, thnx fo r this a rticle ...i ha v be e n luk in fo r the totient style o f so lving m e tho d since la st fe w m o nths the o the r m e tho ds we re a s fa scina ting... ......it wa s e x tre m e ly he lpful... thnx ro hit
Re: Modulo A rithmetic Remainder Theory by ro hit a va sthi - Frida y, 28 Se pte m be r 2007, 08:18 P M he y, thnx fo r this a rticle ...i ha v be e n luk in fo r the totient style o f so lving m e tho d since la st fe w m o nths......it wa s e x tre m e ly he lpful... thnx ro hit
Re: Modulo A rithmetic Remainder Theory by subha de e p da s - Frida y, 28 Se pte m be r 2007, 10:21 P M @AD P ya h , bo th the a nswe rs tha t yo u go t a re right , but i'm ha ving to ugh tim e unde rsta nding yo ur so ln fo r 2^1990/1990 , spe cia lly the pa rt phi(2)=1 phi(5)=4 phi(199)=198 2^4=1 m o d 5--------(1) 2^198=1 m o d 199---------(2) LC M(4,198)=396 ple a se e la bo ra te a little bit m o re
Re: Modulo A rithmetic Remainder Theory by AD P - Frida y, 28 Se pte m be r 2007, 10:24 P M Hi Avia to r D I fo llo we d the Eule r's T he o re m Eule r's T he o re m is the ge ne ra liza tio n o f Fe rm a t's Little T he o re m , a pplica ble whe n ur divide nd is co m po site in fo rm .So we first find prim e fa cto rs fo r the co m po site no . -----Afte r ge tting prim e fa cto rs, use Eule r's to tie nt to o bta in phi(x ) va lue s. phi(x ) just de fine no o f no which a re co prim e to x & <x -----Afte r ge tting to tie nt fo r e a ch prim e fa cto r, a pply Fe rm a t's little o r Eule r fo r e a ch prim e fa cto r He re 1990 is co m po site jo first co nve rt it into prim e s(o r prim e fa cto rs)
8/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by AD P - Frida y, 28 Se pte m be r 2007, 10:33 P M Hi Shubhde e p W a t is Eule r's T he o re m
Eulers Theorem: IF x is any positive integer prime to N then x^Phi(N)=1(mod N) N=a^p.b^q.c^r.(prime factors) Phi(N)=N(1-1/a)*(1-1/b)*(1-1/c) and is known as Eulers Totient Function Phi(N) defines no of numbers which are less thenN and coprime to N If N in the above Eulers Theorem is prime,then Phi(N)=N(1-1/N)= (N-1) So if N is prime and x is coprime to N,then the Eulers Theorem becomes Fermats Theorem As x^(N-1)=1 (mod N) So in this question we first break 1990 into prime factors because for Euler condition is that x & N are prime to each other i.e coprimes 1990=2.5.199 and separately apply Euler hope so its clear now
Re: Modulo A rithmetic Remainder Theory by indira gho sh - Frida y, 28 Se pte m be r 2007, 11:30 P M tha nk s . i'll pra ctice & try a ll this m e tho d. It wa s gre a t . but i ha ve pro ble m s in ge o m e try so wha t i will do ?
Re: Modulo A rithmetic Remainder Theory by Avia to r D - Sa turda y, 29 Se pte m be r 2007, 07:56 AM @AD P - T ha nk s fo r the pro m pt re spo nse . Hi Avia to r D I fo llo we d the Eule r's T he o re m Eule r's T he o re m is the ge ne ra liza tio n o f Fe rm a t's Little T he o re m , a pplica ble whe n ur divide nd is co m po site in fo rm .So we first find prim e fa cto rs fo r the co m po site no . -----Afte r ge tting prim e fa cto rs, use Eule r's to tie nt to o bta in phi(x ) va lue s. phi(x ) just de fine no o f no which a re co prim e to x & <x -----Afte r ge tting to tie nt fo r e a ch prim e fa cto r, a pply Fe rm a t's little o r Eule r fo r e a ch prim e fa cto r He re 1990 is co m po site jo first co nve rt it into prim e s(o r prim e fa cto rs) Hi AD P , R e fe ring to yo ur po st, i unde rsta nd tha t we ca n use Eule r's the o re m whe n the divide nd(N,he re ) is a co m po site no ., but a ddito na lly is it no t re quire d tha t we e nsure tha t diviso r(M,he re ) is re la tive ly co prim e to N ? finding o ut the to tie nt fo r e a ch prim e fa cto r o f 1990(i.e . 2*5*199) wo uld give us the re m a inde rs whe n 2^1990 is divide d by e a ch o f 2^1,5^4 a nd 199^198, ho w do we the n use the se re m a inde rs o bta ine d to ge t the fina l re m a inde r whe n 2^1990 is divide d by 1990 ?
Re: Modulo A rithmetic Remainder Theory by AD P - Sa turda y, 29 Se pte m be r 2007, 08:08 AM @Avia to re just ta k e the LC M o f po we rs Suppo se 1990=2.5.199 phi(2)=1 phi(5)=4 phi(199)=198 be ca use 2^phi(n)=1 m o d n
9/50
3/1/2014
2^phi(5)=2^4=1 m o d 5 2^phi(199)=2^198=1 m o d 199 ta k e LC M o f po we rs i.e . 4 & 198 he re LC M(4,199)=396 so we ca n sa y 2^396=1 m o d 1990---sim ple ho pe u unde rsta nd
Re: Modulo A rithmetic Remainder Theory by m o n ha ldi - Sa turda y, 29 Se pte m be r 2007, 11:11 AM re m a inde r o f 5555......93tim e s divide d by 98 5555555....93 tim e s = 5(111111....93tim e s) = 5{11(10^91 + 10^89 + ...+10^3 + 10^1) +1} = 5{11*10(10^90 + 10^88 +....+10^2 + 1) + 1}......Eq(1) no w 98 ca n be writte n a s = 100-2 o r = 10^2 -2 use re m a inde r the o re m m e tho d a nd put 10^2 = 2 in Eq(1) = 5{110(2^45 + 2^44 + ... + 1) +1} = 5{110(2^46-1) +1} .....Eq(2) re m a inde r o f 2^46 whe n divide d by 98 is 16 (do o wn yo ur o wn but be ca re ful re m a inde r 2^10 / 98 is 44 ) = 5{110(16-1) + 1} = 5(12*15 +1) = 5(-16 +1) = 5 (-15) = -75 = 23 so re m a inde r is 23 le t m e k no w if this is the so lutio n
Re: Modulo A rithmetic Remainder Theory by pra full k um a r - Sa turda y, 29 Se pte m be r 2007, 04:37 P M Hi Fundo o o o o o o o o , just wa nt to sa y T o o o o o o o o o o o o o o o o o o o o o o o o o o o Go o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o d
Re: Modulo A rithmetic Remainder Theory by pra bhje e t k a ur - Sa turda y, 29 Se pte m be r 2007, 06:10 P M he lllo o o sir .. tha nk ss fo r such a e x ce lle nt co nce pt but sir i cldnt be a ble to ta k e o ut the print o f ths pa ge !! wa t shld i do no w ?
Re: Modulo A rithmetic Remainder Theory by ha rsha l m a la viya - Sa turda y, 29 Se pte m be r 2007, 11:18 P M T ha nk yo u,sir,the a rticle is a m a zing.i wa s se a rching fo r the se co nce pts fro m a lo ng tim e ...go d ble ss u guys, u guys r do in a da m n gud jo b...so m e funda s o n a lge bra ,wo uld be o f gre a t he lp,e spe cia lly o n hw. to so lve pro b.o n gra phs a nd so lving pro b.with the he lp o f gra phs...tha nk in u . ha rsha l.
Re: Modulo A rithmetic Remainder Theory by AD P - Sa turda y, 29 Se pte m be r 2007, 11:28 P M @m o n Ha ldi ur so lutio n is co rre ct gud so lutio n ca n u he lp m e in fo llo wing que stio n 40! m do 83
10/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by Na ve e n Na ve e n - Sunda y, 30 Se pte m be r 2007, 12:34 AM
T his is re a lly a gre a t stuff...a nd this site is co o l ha nk s a lo t...

Re: Modulo A rithmetic Remainder Theory by vyo m bha ra dwa j - Sunda y, 30 Se pte m be r 2007, 11:51 AM re a lly a grt..stuff... wa s a ctua lly lo o k ing fo r this o ne ...in a co m pile d fo rm a t... a nd...AAAAHHH!!! he re it is .. thx fundo o ..
Re: Modulo A rithmetic Remainder Theory by m o n ha ldi - Sunda y, 30 Se pte m be r 2007, 06:52 P M hi AD P u ve a tte m pt a ll m o st co rre ct fo r 40! m o d 83 until 41!^2 m o d 83 =1 41! m o d 83 = 1 o r -1 thn 41!^2 m o d 83 = 1 the re m ust be so m e the o re m 4 it i didnt go t the a ns bt it ll be 2 o r 81 T G ll he lp to find the co rre ct so lutio n W HAT DO U SAY T G ABT T HS P R BLM po st d so lutio n if a nyo ne ha s it
Re: Modulo A rithmetic Remainder Theory by pa ra g k um a r - Mo nda y, 1 O cto be r 2007, 02:06 AM why ca n't 41!%83 be -1 ?
Re: Modulo A rithmetic Remainder Theory by AD P - Mo nda y, 1 O cto be r 2007, 07:21 AM @ m o n ha ldi W ilso n's T he o re m
Re: Modulo A rithmetic Remainder Theory by m o n ha ldi - Mo nda y, 1 O cto be r 2007, 11:53 AM i dnt m e a n to sa y tha t 41! m o d 83 ca nt be -1 ye s it ca n be -1 o r 1 n thus i pre dicte d a ns is e ithe r 2 o r 81 bt which o ne is co rre ct i dnt k nw
Re: Modulo A rithmetic Remainder Theory by T o ta lga dha fa n - Mo nda y, 1 O cto be r 2007, 01:12 P M 2 2 2 2 2 2 2 2 2 2 gud
11/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by pa ra g k um a r - T ue sda y, 2 O cto be r 2007, 12:01 AM
I ha ve a big do ubt o n yo ur a ppro a ch. 2^4 m o d 5=1 a nd 2^198 m o d 199=1 do e sn't m e a n tha t 2^396 m o d 1990=1. It ca n e ve n be che ck e d by the fa ct tha t 2^396 a nd 1990 a re bo th e ve n a nd he nce the re m a inde r sho uld be e ve n. My so lutio n is lik e this 2^1990 m o d 1990 = 2^1989/(199*5) using chine se re m a inde r the o rum , 2^1989 m o d 199(A) = 114(r1) 2^1989 m o d 5(B)= 2(r2) fo r 199x +5y=1, x =-1 a nd y=40 he nce re m a inde r = 199*2*-1+114*5*40=22402 o r, 22402-995*22=512 since the num e ra to r a nd de no m ina to r we re bo th divide d by 2 he nce the a ctua l re m a inde r is 512*2=1024.
Re: Modulo A rithmetic Remainder Theory by T o ta l Ga dha - W e dne sda y, 3 O cto be r 2007, 04:23 AM Remainder when 40! is divided by 83: W e k no w tha t 82! + 1 is divisible by 83. 82! = 1 2 3 .... 39 40 41 42 ... 81 82 --> re m a inde r by 83 = 1 2 3 .... 39 40 - 42 - 41 - 40 - 39 ... - 3 -2 - 1 = (40!) 2 42 41 ---> re m a inde r with 83 = R 2 62. No r R 2 62 + 1 is divisible by 83 --> R 2 62 + 1 = 83k --> R 2 = (83k - 1)/62 ---> k = 3 a nd R 2 = 4 --> R = 2 = 2 o r 81.
Re: Modulo A rithmetic Remainder Theory by R ishi Ka po o r - W e dne sda y, 3 O cto be r 2007, 04:36 AM He y T G ple a se lo o k a t the blo g e ntrie s a nd re ply m y que ry tha t I ha ve po ste d the re ...
Re: Modulo A rithmetic Remainder Theory by m o n ha ldi - W e dne sda y, 3 O cto be r 2007, 06:40 AM hi T G bt que stio n re m a ins the sa m e wha t is the e x a ct a ns b/w 2 & 81
Re: Modulo A rithmetic Remainder Theory by Ne o phyte 2C AT - W e dne sda y, 3 O cto be r 2007, 03:25 P M nice e x a m ple s to co ve r a ll the co nce pts tha nk yo u ve ry m uch
Re: Modulo A rithmetic Remainder Theory by Nitin Singha l - W e dne sda y, 3 O cto be r 2007, 04:59 P M Hi T G, ye ste da y i wa s struggling with a pro ble m which cco m e s unde r re m a inde r the o ry.P le a se e x pla in a s i trie d to so lve it with a bo ve give n the o ro m s but re sulte d in a ve ry co m ple x so lutio n.Just te ll m e if this pro ble m co uld be so lve d in a ny sim ple r wa y.T he pro ble m is 3^1001 is de vide d by 1001 the n wha t is the re m a inde r. Ma ny tha nk s, Nitin
Re: Modulo A rithmetic Remainder Theory by Va run C ho udha ry - T hursda y, 4 O cto be r 2007, 01:23 P M
12/50
3/1/2014
@Shubhagata roy rem of 7^115 divided by 114?? 7^3=343 7^115=7^(3*38+1) =>7^115=(343^38)*7 So , the qstn is no w (343^38)*7/114. Also ,114*3=342.i.e 1 le ss tha n 343 T he re fo re by re m a inde r the o re m it be co m e s = (1^38)*7/114 =7/114 =>Ans is 7
Re: Modulo A rithmetic Remainder Theory by fundo o bo nd - T hursda y, 4 O cto be r 2007, 03:05 P M hi nitin, 1001 is a prim e no . if i m nt m ista k ing...so its e ule r no . is 1000.he nce re m ll be 3?whts d give n a ns?
Re: Modulo A rithmetic Remainder Theory by Nitin Singha l - T hursda y, 4 O cto be r 2007, 06:53 P M No fundo o bo nd 1001 is no t a prim e num be r.It is de visible by 7,11 a nd 13. T he a nswe r is 947.
Re: Modulo A rithmetic Remainder Theory by T o ta l Ga dha - T hursda y, 4 O cto be r 2007, 10:31 P M Hi Nitin, 1001 = 7 11 13 No w, 3 1001 whe n divide d by 7, 11, a nd 13 give s re m a inde rs 5, 3 a nd 9, re spe ctive ly. Le t N = 3 1001. N = 7a + 5, N = 11b + 3, N = 13c + 9. Multiply first e qua tio n by 22, se co nd e qua tio n by 21. 22N = 154N + 110 21N = 231N + 63, Subtra cting we ge t, N = 47 - 77k ---> 78N = 3666 - 1001M Also , N = 13c + 9 ---> 77N = 1001c + 693 Subtra cting N = 2973 - 1001L = 2002 - 1001L + 971 T he re fo re , the re m a inde r is 971. T o ta l Ga dha
Re: Modulo A rithmetic Remainder Theory by Ank ush Ja in - Frida y, 5 O cto be r 2007, 02:12 AM 1001 = 77 * 13. If we use chine se re m a inde r the o re m a lso , a = 77, b = 13 r1 = 47, r2 = 9 x = -1, y = 6 T he re fo re re m a inde r = a x r2 + byr1 = -77*9 + 13*6*47 = 2973 R e m a ine r (2973/1001) = 971. So , i think 971 is the a nswe r
Re: Modulo A rithmetic Remainder Theory by Va run C ho udha ry - Frida y, 5 O cto be r 2007, 01:31 P M @ Deep A grawal - for 7^115 / 114.
13/50
3/1/2014
P hi(114)=36 a nd no t 66.... .i.e . 114(1-1/2)*(1-1/3)*(1-1/19) = 36 the re fo re we a re le ft with 7^7/114 a nd 7^3/114=1
=>7^7=7^6.7 =>qstn be co m e s 7/114= a ns=7

Re: Modulo A rithmetic Remainder Theory by De e p Agra wa l - Sa turda y, 6 O cto be r 2007, 01:24 AM @Va run T ha nk s fo r po inting it o ut. Am so rry fo r the m ista k e
Re: Modulo A rithmetic Remainder Theory by Am a le sh Ba ndo pa dhya y - Sa turda y, 6 O cto be r 2007, 01:58 P M U r re a lly a cha m p.. T ha nk s fo r the wo nde rful a rticle ...
Re: Modulo A rithmetic Remainder Theory by Am e ya R a ich - Sa turda y, 6 O cto be r 2007, 10:27 P M He llo sir.. C o uld yo u pls te ll m e ho w to use a bo ve ide ntitie s in so lving sum s lik e : re m a inde r o f: 1) 77777777.... (37 digits) m o d 19 ? 2) 123412341234 ... (89 tim e s) m o d 19 ? is the re a nything e lse we ne e d to k no w to so lve the se ? My frie nd sa ys fo r Q 1. we ca n use 7777..18 tim e s m o d 19 =1 since Eule r o f fi(19) =18... but ho w ca n we use this Fe rm a t's little thm o n "no . o f DIGIT S" ??
Re: Modulo A rithmetic Remainder Theory by Sa ge e r Abdulla - Sa turda y, 6 O cto be r 2007, 10:31 P M Reminder(2^1990)divided by 1990 In this ca se N=1990 =2.5.199 so find the re m inde r whe n divide d by 199 a nd m ultiply it wid 2*5 since 2 a nd 199 a re co prim e s. a ga in divide by 199 if its divisible .. tha ts the re m inde r.. suppo se if we ge t 25 a s re m inde r whe n divide d by 199. m ultiply 25 wid 2*5 ie 10. we will ge t 250.. which sho uld be divide d by 199 a gio n to ge t the re m inde r.. this sho uld be the sim plifie d ve rsio n o f a nswe r.
Re: Modulo A rithmetic Remainder Theory by rishu ba tra - Mo nda y, 8 O cto be r 2007, 08:10 AM tha nx fundo o o fo r this m indblo wing tuto ria l...it is o f im m e nse he lp...but i ha ve a big do ubt...do e s m o dula r a rithm e tic fo llo w the se rule s?: 1.(re m a inde r o f 1 e x pre ssio n)*(re m a inde r o f se co nd e x pre ssio n)=(re m a inde r o f o ve ra ll e x pre ssio n) 2..(re m a inde r o f 1 e x pre ssio n)+(re m a inde r o f se co nd e x pre ssio n)=(re m a inde r o f o ve ra ll e x pre ssio n) 3..(re m a inde r o f 1 e x pre ssio n)-(re m a inde r o f se co nd e x pre ssio n)=(re m a inde r o f o ve ra ll e x pre ssio n) do e s this m e a n if 1998*1999*2000 is divide d by 47,we find re m a inde rs individua lly with re spe ctive te rm s in the e x pre ssio n n m ultiply the m to ge t the fina l a nswe r??
Re: Modulo A rithmetic Remainder Theory by Sha sha nk Ba lo o ni - Mo nda y, 8 O cto be r 2007, 11:19 AM Hi FUNDO O .....U ha ve re a lly x pla ine d the do ubts lucidly .....T ha nk s a lo t I ha ve 2 que stio ns ... 1.39! divide d by 41 in this que stio n i didnt ge t 40!=41K+40 .. So m e m o re que stio n o n wilso n the o re m ...
2.Please giv some example where we cant apply any other theorem but only Chinese Remainder Theorem
14/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by Va run C ho udha ry - Mo nda y, 8 O cto be r 2007, 03:01 P M @ rishu ba tra T ho ugh I wa s no t a sk e d but still i fe lt lik e a nswe ring it... Answe r to ur qstn is a sim ple ye s.. the rule sa ys tha t a ll the o pe ra to rs (+,-,*) re m a in a s the y a re a nd ne e d to be o pe ra te d o n the individua l re m a inde rs which a re o bta ine d by se pa ra te ly finding o ut re m a inde r fo r e a ch o f the num e ra to rs..
Re: Modulo A rithmetic Remainder Theory by Sha sha nk Ba lo o ni - Mo nda y, 8 O cto be r 2007, 03:12 P M
Hi guys This seems quiet Diff prob ..please help Remainder for ..by Chinese theorem (777)^777/1000
Re: Modulo A rithmetic Remainder Theory by fundo o bo nd - Mo nda y, 8 O cto be r 2007, 03:48 P M hi rishu, u hv a sk e d re a lly nic qns n i think i shld hv include d the se things in the a rticle ...but a nywa ys it's be tte r la te tha n ne ve r... ur 1st sta te m e nt "1.(re m a inde r o f 1 e x pre ssio n)*(re m a inde r o f se co nd e x pre ssio n)=(re m a inde r o f o ve ra ll e x pre ssio n)" ye s this is true ...i ll ta k e d e x a m ple u hv give n.... 1998*1999*2000 is divide d by 47 find re m fo r 1998,it is 47.so fo r 1999 n 2000 it ll be 48 a nd 49 re sp. so re m ll be 24*25*26 % 47..
Re: Modulo A rithmetic Remainder Theory by sa chin singh - Mo nda y, 8 O cto be r 2007, 07:43 P M Is the a nswe r fo r this is 72??? i ha ve use d e ule r the o re m he re ....co nfirm m e the a nswe r.
Re: Modulo A rithmetic Remainder Theory by lo ve k um a r - Mo nda y, 8 O cto be r 2007, 10:56 P M Hi the re is a e rro r in d so lutio n o f e x . to find la st 3 digit o f 57^802 while ca lcula ting (1000)=1000(1-1/2)(1-1/4),it shud be 1000(1-1/2)(11/3) a s 1000=(2^3)(5^3).. bye n tk cr
Re: Modulo A rithmetic Remainder Theory by Am it C ha nda liya - T ue sda y, 9 O cto be r 2007, 08:14 AM hi a ll, I find o ne pro ble m while so lving o ne o f the pa pe rs.
15/50
3/1/2014
Q . wha t will be the re m a inde r if (2222^5555+5555^2222) is divide d by 7 ? pla se give a nswe r with co m ple te so lutio n...
Re: Modulo A rithmetic Remainder Theory by suk shim a na ik - T ue sda y, 9 O cto be r 2007, 11:56 AM tha nx a lo t sir.....i ha ve no t jo ine d a ny co a ching ce ntre he re ....a s i find m o re m a te ria ls he re fro m u tha n a ny co a ching cla sse s......the se fundo o the o ra m s r no t e ve n in go o d bo o k s..... sir i will be a ppe a ring ca t-2008 & i ha ve sta rte d m y pre p. o n Q A no w....but i ne e d so m e ba sics o r co rre ct pla nning & m e tho d to be stro ng in Q A.SO sir ca n u he lp m e to cho o se a co rre ct pa th....
Re: Modulo A rithmetic Remainder Theory by Va run C ho udha ry - T ue sda y, 9 O cto be r 2007, 01:17 P M @ A mit Chandaliya
Hi Am it, pe rha ps this ha s be e n discusse in the fo rum be fo re a lso ... 2222 = 7*317+3 a nd 5555 = 7*793+4 => Q stn be co m e s (3^5555+4^2222)%7 3^3 % 7 = 27%7 = -1 4^3 % 7 = 64)%7 = 1 =>3^5555 = 3^(3*1851+2) a nd 4^2222= 4^(3*740+2) no w, we ha ve first pa rt o f qstn a s :((27)^1851 * (3^2)) %7 = (-1)^1851 * 2 =-1*2 = -2 a nd se co nd pa rt is :((64)^740 * (4^2)) %7 = (-1)^740 * 2 =1*2 = 2
T he re fo re a nswe r wud be (-2)+(2) = 0 Ho pe this is a full so lutio n.....

Re: Modulo A rithmetic Remainder Theory by Va run C ho udha ry - T ue sda y, 9 O cto be r 2007, 01:24 P M @love kumar U fo und a m ista k e but u didn't lo o k into it ca re fully.Its a typo (printing m ista k e ) no t a n e rro r. T he typo is da t (1000)=1000(1-1/2)(1-1/4) shud be 1000(1-1/2)(1-1/5) a s a s 1000=(2^3)(5^3).. => u ha ve to ta k e 2 a nd 5 a s "a " a nd "b" re spe ctive ly. The resultant value comes to 400 only...
so solution is alright...hope you got ur mistake....

Re: Modulo A rithmetic Remainder Theory by Sha sha nk Ba lo o ni - T ue sda y, 9 O cto be r 2007, 02:47 P M
Hi PLease Somebody solve this one

This seems quiet Diff prob ..please help
Find the Remainder for this expression.. (777)^777/1000 (Chinese theorem may help here)
16/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by rishu ba tra - T ue sda y, 9 O cto be r 2007, 07:42 P M hi a ll, ho w do we so lve the fo llo win pro ble m : find the re m a inde r whe n 123412341234.....(89tim e s)is divide d by 19?
Re: Modulo A rithmetic Remainder Theory by Am e ya R a ich - T ue sda y, 9 O cto be r 2007, 09:47 P M
tens digit of 2^999 = ? Now obviously we have to divide by 100 and find the remainder. If we use Euler, then some things going wrong and i cant fine out wat ? See.. Rem (2^999/ 100) = 4* (Rem of (2^997)/25) Now :: Rem of (2^997)/25 since 2 and 25 are coprime. Euler totient of 25 = 20, Rem of 2^20/25=1 Thus Rem of 2^980/25=1. Thus we have to find Rem(2^17/25) now, 2^11/25 yield 24 as remainder, we know, thus 24* Rem(2^6/25) = Rem (24*14/25) = 11. Now from step (1) above final remainder = 11*4 = 44. Where am i going wrong ??????? :::::::::::::::::::::::::A LTERNA TE :::::::::::::::::::::::::: Rem (2^999/ 100) = 4* (Rem of (2^997)/25) ........(1) now, we know , rem(2^11/25)= -1 thus, Rem( (2^990)/ 25) = Rem (2^11/25 * 90) =1. Thus we are left with Rem (2^7/25) = 7; now frm step (1) above , final answer is 4*7 = 28 . Where am i going wrong ??????? ?????????????????????????????????????????????????????????????
........(1)
Re: Modulo A rithmetic Remainder Theory by lo ve k um a r - T ue sda y, 9 O cto be r 2007, 09:55 P M hi va run!! pre tty rite .. tha nk s
Re: Modulo A rithmetic Remainder Theory by R AMA KR ISHNA T ANKU - W e dne sda y, 10 O cto be r 2007, 08:04 AM tha nk u u fundo , it is ve ry use ful fo r m e , ia m ve ry m uch in co nfusio n be fo re this .Any wa y o nce a ga in tha nk u
17/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by m o nu va rshne y - W e dne sda y, 10 O cto be r 2007, 12:27 P M As the theories given by fundoo and tG r fabulous. But I have some queries. IN wilsons theory,how the 2nd example gives 1 remainder.pleae somebody make it clear. T reat this question as u have not done 1st example of same theorem. Also explain the Wilsons theorem morefor my convenience.
Re: Modulo A rithmetic Remainder Theory by Va run C ho udha ry - W e dne sda y, 10 O cto be r 2007, 02:04 P M @A meya Raich
you are getting wrong in the very preliminary step. which is 2^11 % 25= -1 => wrong buddy infa ct it shud be 2^10 % 25= -1 Fo llo w the ve ry sa m e ste ps tha t u ha ve ta k e n..... Y o u will ge t the ve ry sa m e a nswe r in bo th the ca se a nd fo r ur e a se i wud sa y the a nswe r is 88 Also u sa id tha t Rem( (2^990)/ 25) = Rem (2^11/25 * 90) =1. Thus we are left with Rem (2^7/25) = 7; =>wrong,it shud be 3 now frm step (1) above , final answer is 4*7 = 28 . I am rewriting the above steps with corrections Rem( (2^990)/ 25) = Rem (2^(10*99+7)/25) => (-1)^99 * rem (2^7 /25) => -3 =>22 final answer is 4*22 = 88
Re: Modulo A rithmetic Remainder Theory by Va run C ho udha ry - W e dne sda y, 10 O cto be r 2007, 02:49 P M
hi e ve rybo dy..... plz so lve (19^36 + 17^36) %111...

Re: Modulo A rithmetic Remainder Theory by Na re sh K - W e dne sda y, 10 O cto be r 2007, 05:08 P M T ha nx Bo nd..T ha t wa s a go o d co m pila tio n I fe lt C hine se R e m a inde r T he o re m to be a little re dunda nt. Fra nk ly we ca n a lwa ys lo gica lly e va lua te the a nswe r in such give n co nditio ns. In ur e x a m ple , 3^101 % 77 u ha ve a rrive d a t the num be r o f the fo rm 7a +5 o r 11b+3. So the re m a inde r will be the le a st num be r co m m o n to such se rie s. Q uick ly it will give 47 !! Lo o k ing fwd fo r m o re to co m e C he e rs Ne o
Re: Modulo A rithmetic Remainder Theory by fundo o bo nd - W e dne sda y, 10 O cto be r 2007, 06:17 P M Hi Sha sha nk , Are u sure the qn. is (777)^777/1000 ?? I a m finding it diff. to cra ck it...m ight be it is (777)^777/100 ?? wht do u sa y? Any ta k e rs fo r this? but fra nk ly i think u wo nt find such pbm s in C AT ... re ga rds, fundo o
Re: Modulo A rithmetic Remainder Theory by P a va n P a de k a l - Frida y, 12 O cto be r 2007, 08:37 AM
18/50
3/1/2014
Sho uldnt phi(63) in the first e x a m ple be 36 a nd no t 18 a s m e ntio ne d? It do e snt m a k e a diffe re nce to the fina l a nswe r tho ugh
Re: Modulo A rithmetic Remainder Theory by Sha sha nk Ba lo o ni - Frida y, 12 O cto be r 2007, 11:01 AM hi
Fundoo Bond
(777)^777/ 1001 oops take the question as abv 1000 replaced by 1001(7*11*13)
Re: Modulo A rithmetic Remainder Theory by T o ta l Ga dha - Mo nda y, 15 O cto be r 2007, 01:55 AM 1. 777 777/1000 --> R e m a inde r = 797 (Use Bino m ia l to find the la st thre e digits) 2. 644
Re: Modulo A rithmetic Remainder Theory by Anish R a i - Mo nda y, 15 O cto be r 2007, 05:48 P M Nice o ne T G
Re: Modulo A rithmetic Remainder Theory by HAR I P O T T ER - T ue sda y, 16 O cto be r 2007, 08:57 AM hi ha ldi ca n yo u pls e x pla in the re m a inde r the o re m u use d... substitutio n o f 10^ 2 by 2
Re: Modulo A rithmetic Remainder Theory by HAR I P O T T ER - T ue sda y, 16 O cto be r 2007, 10:02 AM hi T G ho w do u find la st n digits using bino m ia l the o re m .... a tm o st ho w m a ny 'la st' digits ca n we find....pls e x pla in ho w u go t 797 in 777^777/1000.. i le a rnt ho w to find the la st 2 fro m yo ur po sts... but la st 3 i dunno .. tha nk s
Re: Modulo A rithmetic Remainder Theory by fundo o bo nd - T hursda y, 18 O cto be r 2007, 07:30 P M
hi shashank, if this is the qn... (777)^777/1001 1001=(7*11*13) so basically u have to find remainder of (777)^776/(11*13) do this by c hinese thm and then multiply the resultant rem by 7. if u still need my assistanc e done be afraid to revert. regards, fundoo
3/1/2014
Re: Modulo A rithmetic Remainder Theory by a shish bha rdwa j - Sa turda y, 20 O cto be r 2007, 11:50 P M hi va run , it ca n be so lve d using chine se re m a inde r the o re m .. (19^36 + 17^36) %111 so i will divide this into two pa rt fist 19^36%111 a nd o the r 17^36%111 so o ur 111 ==> 3*37 bo th a re prim e so a =3 no w we ha ve to find the re m a inde r fo r 19^36/3 =>1=r1 19^36/37=> 1=r2 so a nd o ur a a nd b a re 3 a nd 37 so so 3*x +37*y=1 it give s m e x =-12 a nd y=1
3*-12*1+37*1*1= -36+37 =>1
no w sa m e wa y it ca n be do ne fo r 17^36 so 17^36/3 => 2^36/3 => 8^12/3 => (-1)^12/3 =>1 17^36/37 =>1 so it will a lso fo llo w the sa m e pa tte rn a nd a nswe r will be 2 =>1+1...
Re: Modulo A rithmetic Remainder Theory by m o jo bo nd - Sunda y, 21 O cto be r 2007, 12:00 AM Hi Fundo o P le a se cla rify o ne thing in the que stio n which sha sha nk a sk e d i.e . 777^777/1001 ca nce lling 7 le a ve s 111 e x tra a lso i.e it be co m e s (777^776 * 111) / 11*13.So a ltho 777^776 /11*13 is m a na ga ble but ho w to ta k e into a cco unt 111 ? P lz he lp
Re: Modulo A rithmetic Remainder Theory by a m ba r pa til - Frida y, 21 Ma rch 2008, 05:49 P M find the la st thre e digits o f 3 1994 . No w a s pe r Eule r the o re m , R e m [3 400/1000] = 1 . Sim ila rly , R e m [3 2000/1000] = 1 . C a n a nybo dy te ll m e ho w do we pro ce e d furthe r ? Ho w do we ha ndle the e x tra 3 6 ?
Re: Modulo A rithmetic Remainder Theory by T G T e a m - Sa turda y, 22 Ma rch 2008, 01:40 P M find the la st thre e digits o f 3 1994 . Hi Am ba r He re I go . 3 2000 = 3 6*3 1994 = 1(m o d1000) Le t 3 1994 = x (m o d1000) a nd a s 3 6 = 729 => 729x = 1(m o d1000) => 729x - 1000y = 1 No w using Eulid's Algo rithm 1 = 3(1) - 1(2) 1 = 3(1) - 1(8 - 2*3) 1 = 3(3) - 1(8) 1 = 3(19 - 2*8) - 1(8) 1 = 3(19) - 7(8) 1 = 3(19) - 7(84 - 4*19) 1 = 31(19) - 7(84) 1 = 31(187 - 2*84) - 7(84) 1 = 31(187) - 69(84) 1 = 31(187) - 69(271 - 187) 1 = 100(187) - 69(271) 1 = 100(729 - 2*271) - 69(271)
20/50
3/1/2014
1 = 100(729) - 269(271) 1 = 100(729) - 269(1000 - 729) 1 = 369(729) - 269(1000) => 31994 = 369mod1000
Re: Modulo A rithmetic Remainder Theory by Vipul P a tk i - Mo nda y, 24 Ma rch 2008, 04:52 AM T o o go o d...So m e o f the pro ble m s a re so lve d in Arun Sha rm a 's bo o k a nd it is a lwa ys go o d to se e a lte rna tive so lutio ns to such k ind o f pro ble m s. R e ga rds, Vipul
Re: Modulo A rithmetic Remainder Theory by a m ba r pa til - Mo nda y, 24 Ma rch 2008, 04:50 P M he y k a m a l , T ha nk s fo r po sting the so lutio n ... but i a m no t a wa re o f the Eulid's the o re m ... ca n yo u ple a se po st tha t to o ?? Ho we ve r , i ha ve fo und o ne o the r wa y to so lve the pro ble m 3 1994 = 9 997=( 10 - 1) 997 . no w using bino m ia l e x pa nsio n , we ca n ge t the la ste thre e digits . the a nswe r co m e s o utta be 369 .
Re: Modulo A rithmetic Remainder Theory by Hungry Ga dha ! - Frida y, 18 April 2008, 07:50 P M
Just Am a zing JO B.....fundo o .. T ha nk s, HG
fa nta stic...stuff.
Re: Modulo A rithmetic Remainder Theory by Am s Kul - Sunda y, 4 Ma y 2008, 12:18 P M Hi Fundoo Thanks a lot for the ar ticle ..
Re: Modulo A rithmetic Remainder Theory by va m shi m a cha na pa lly - Sunda y, 11 Ma y 2008, 12:30 P M Hi... I wa nt the so lutio n fo r the prble m give n be lo w wha t is the re m a inde r whe n 7^7^7 is divide d by 13... T ha nk s in a dva nce
Re: Modulo A rithmetic Remainder Theory by va m shi m a cha na pa lly - Sunda y, 11 Ma y 2008, 07:44 P M Hi guys.. go t the pro ce dure
Re: Modulo A rithmetic Remainder Theory by a a - Mo nda y, 12 Ma y 2008, 10:01 P M Hi va m shi is the a nswe r 6??? ple a se co nfirm
21/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by Nik unj Gupta - Mo nda y, 19 Ma y 2008, 09:11 AM Hi....O ne thing tha t I a m no t ge tting in C hine se the o rm is ho w to se t va lue s fo r x ,y be ca use the re m ight be the ca se whe n the re a re m o re tha n 2 va lue s sa tisfying e q a x +by=1...fo r e g wha t is the re m a inde r whe n we divide 123456789 by 6..... i a m no t ge tting the a ns in a ny ca se ...
Re: Modulo A rithmetic Remainder Theory by T G T e a m - T hursda y, 29 Ma y 2008, 05:17 P M Hi Nik unj He re go e s the e x pla na tio n. Do n't he sita te to a sk a nything which yo u do n't fo llo w. Q. what is the remainder when we divide 123456789 by 6 6 = 3*2 => 3x - 2y = 1 by m e re o bse rva tio n we ge t to k no w tha t x = 1 a nd y = 1. No w 123456789 = 1m o d2 a lso , 123456789 = 0m o d3. No w using CRT, 123456789 = 3*1*1 - 2*1*0 = 3m o d6. Alternative Method: R e m [123456789]/6 = R e m [3*41152263]/3*2 = 3*R e m [41152263]/2 = 3*1 = 3
Re: Modulo A rithmetic Remainder Theory by Biswa jit Se n - Frida y, 30 Ma y 2008, 03:53 P M ho w do yo u so lve 38! / 41 ? if we use the sa m e m e tho d use d to so lve 39!/41, the n it lo o k s so m e thing lik e this. 40! / 41 = 40.39.38! / 41 R e m a inde r [ 40! / 41 ] = R e m a inde r [ 40.39.38! / 41] ie . 40 = 40 . R e m a inde r o f (39*38! / 41) tha t m e a ns re m a inde r o f (39.38! / 41) sho uld be 1. tha t m e a ns re m a inde r o f (38! / 41) will be 1/39 ?????? i a m no t co nvince dd. ple a se cla rify??????
Re: Modulo A rithmetic Remainder Theory by a k sha y m ishra - Sunda y, 15 June 2008, 10:11 P M hi T G!!! plz he lp m e wid dis pro ble m - re m (8^182)/65 i ws do ing it wid chine se re m a inde r the o re m 65=13*5, >>>>>a =5,b=13; re m (8^182)/5=re m ((8^45))^4)*(8^2)/5)=4>>>>r1 re m (8^182)/13=12>>>r2 no w 5x +13y=1;>>>x =-5,y=2; so a r2x +br1y=212???????
i cud ge t da a nswe r a s fo llo wsphi(65)=48 re m ((8^182)/65)=re m ((8^48)^3)*8^38)/65 >>=re m (8^38)/65 >>re m ((8^4)^9*8^2)/65 re m (8^4)/65=1 thrfre >>=re m (8^2)/65=64 but wa t a bt chine se re m a inde r the o re m wa ts wro ng wid da t??
22/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by R a m k rishna R o y - W e dne sda y, 18 June 2008, 02:07 P M to o o o o o o o o o o o go o d...tha nk yo u sir.
Re: Modulo A rithmetic Remainder Theory by pra ve e n k um a r - Frida y, 20 June 2008, 04:16 P M hi ppl, i m a ne w use r to this fo rum . N i a m lik ing it. All sum s r inte re sting. And i hv a do ubt. In the sum re m a inde r o f 40!/83 i m no t a ble to unde rsta nd ho w the fo llo wing ste p a rrive d fro m (81.80.79.--------.42.41!)%83=1 -2*-3*-4*-5....-41*41! = 41!*41!%83 = (41!)^2%83 = 1 which is po ssible o nly whe n 41! m o d 83=1 be ca use the re a re e ve n no o f te rm s so ne ga tive sign go t ca nce lle d. C o uld so m e o ne e x pla in m e this o ne . P ra ve e n.
Re: Modulo A rithmetic Remainder Theory by a rpit m ishra - Sa turda y, 21 June 2008, 01:39 P M hi ne o ......... this is the e a sy que s..........no ne e d to use chine se the o re m 8^182 = (8^2)^91 =64^91 =(65-1)^ 91 which whe n divide by 65 give s re m a inde r o f -1 o r 64.......
Re: Modulo A rithmetic Remainder Theory by Biswa jit Se n - Mo nda y, 23 June 2008, 10:59 P M hi guys......this is a n inte re sting que stio n fo r a ll to wo rk o ut...ve ry sim ple o ne .....just a sm a ll trick invo lve d.... if A=33*32*31*30*29*28 & if R e m a inde r [ A/(12k )] = 0......the n find the m inim um va lue o f k ?
Re: Modulo A rithmetic Remainder Theory by Ne o Sinha - Mo nda y, 23 June 2008, 10:57 P M K=0
Re: Modulo A rithmetic Remainder Theory by shiva m m e hra - T ue sda y, 24 June 2008, 08:59 P M
plz help this part gone over head totally

Le t 3 1994 = x (m o d1000) a nd a s 3 6 = 729 => 729x = 1(m o d1000) => 729x - 1000y = 1 No w using Eulid's Algo rithm 1 = 3(1) - 1(2) 1 = 3(1) - 1(8 - 2*3) 1 = 3(3) - 1(8) 1 = 3(19 - 2*8) - 1(8) 1 = 3(19) - 7(8) 1 = 3(19) - 7(84 - 4*19) 1 = 31(19) - 7(84) 1 = 31(187 - 2*84) - 7(84) 1 = 31(187) - 69(84) 1 = 31(187) - 69(271 - 187) 1 = 100(187) - 69(271) 1 = 100(729 - 2*271) - 69(271) 1 = 100(729) - 269(271)
23/50
3/1/2014
1 = 100(729) - 269(1000 - 729) 1 = 369(729) - 269(1000)
Re: Modulo A rithmetic Remainder Theory by m a nshul go e l - T hursda y, 26 June 2008, 09:13 AM re a lly a we so m e fa bulo us a nd e x ce lle nt ... T ha nx x Fundo o Bo nd.. u did a gr8 jo b.. Mind blo wing
Re: Modulo A rithmetic Remainder Theory by a bhina v tripa thi - T hursda y, 26 June 2008, 11:43 P M tha nk s a lo t fo r such a use ful a rticle ........... o ne thing which i did'nt unde rsta nd wa s y we ha ve to x pre ss 32^32 in the fo rm 6k +r????? plz e la bo ra te .....!! wa iting fo r re ply
Re: Modulo A rithmetic Remainder Theory by Sure ndra n C ha ndra va tha na n - T ue sda y, 1 July 2008, 08:13 P M Hi, T he va lue o f k = 1 fo r sure . Bco z 12 = 3 x 4 & we a lre a dy ha ve o ne 3 a nd o ne 4 in the num e ra to r(ie , 33 = 3x 11, 28=4x 7). So whe n A is divide d by 12, sure ly the re m a inde r will be ze ro . He nce , K ca n be 1 since m inim um va lue is a sk e d.
Re: Modulo A rithmetic Remainder Theory by Sure ndra n C ha ndra va tha na n - T ue sda y, 1 July 2008, 09:02 P M Hi, T he va lue o f k = 1 fo r sure . Bco z 12 = 3 x 4 & we a lre a dy ha ve o ne 3 a nd o ne 4 in the num e ra to r(ie , 33 = 3x 11, 28=4x 7). So whe n A is divide d by 12, sure ly the re m a inde r will be ze ro . He nce , K ca n be 1 since m inim um va lue is a sk e d.
Re: Modulo A rithmetic Remainder Theory by shubha m singh - T ue sda y, 1 July 2008, 10:42 P M the m inim um va lue o f k will be 1.
Re: Modulo A rithmetic Remainder Theory by shubha m singh - T ue sda y, 1 July 2008, 10:56 P M hi ne o .u ca n find o ut the a nswe r by the re m a inde r the o rm .the a nswe r will be 64
Re: Modulo A rithmetic Remainder Theory by Ga ura v Ve rm a - W e dne sda y, 2 July 2008, 02:30 P M good ,nice theorems ..its time saving a lot ..
please help me 2 solve this :

3/1/2014
find the 3 digit prime no. thats divides 2000!divided by 1000!^2
Re: Modulo A rithmetic Remainder Theory by R a k e sh Aga rwa l - Sa turda y, 12 July 2008, 11:28 AM hi i a m a ne w use r o ut he re a nd fo und it a ve ry use ful fo rum .. no w Ga ura v i think yo ur que stio n is gre a te st 3 digit prim e no . which is a fa cto r o f (2000!)/(1000!^2).. if it is so the so lutio n is he re ... if yo u se le ct a prim e no . sa y 673 no w 2000! ha s 2000m o d673 i.e 2 fa cto rs a s 673 a nd 1000! ha s 1000m o d673 i.e 1 fa cto r o f 673 so 1000!^2 ha s 2 fa cto rs o f 673 so 2000!/(1000!^2) has no factors of 673. so a ll prim e no .s a bo ve 673 will fo llo w the sa m e tre nd.. no w ta k e the ca se o f a prim e no . le ss tha n 673.. 671 is no t a prim e no . a s it is divisible by 11 a lso 667 is no t e ithe r a s it is divisible by 23 so ne x t prim e no is 661 2000! ha s 2000!m o d661 i.e 3 fa cto rs o f 661 which a re 661,1322 a nd 1983 since 1000! ha s 1000!m o d661 i.e 1 fa cto r o f 661 so (1000!^2) ha s 2 fa cto rs o f 661 so we a rrrive a t the a ns 2000!/(1000!^2) ha s 661 a s o ne o f its fa cto r a nd is the la rge st prim e no . tha t ca n divide 2000!/(1000!^2) ho pe u go t tha t.... te ll m e if i m wro ng.. plz re ga rds R a k e sh
Re: Modulo A rithmetic Remainder Theory by P o o ja Sinha - T ue sda y, 15 July 2008, 02:07 P M
Hey, The last example (while explaining the c onc epts i.e. Find the remainder when 8^643 is divided by 132 )that was solved had made use of Euler's theorum, whereas I tried to make use of Chinese remainder Theorum by the following method : Break 132 into 4 and 33 and sinc e 4 and 33 are c o-primes therefore find Rem(8^643/4) = 0=r1 Rem(8^643/33) -> Applying euler's theorum we get remainder as 17=r2 Henc e, Rem(8^643/132) = 4r2x + 33r1y where 4x+33y=1 (x,y) = (-8,1) Henc e, Rem(8^643/132) = 4*17*-8 + 33*0*1 = -544 , whic h is not the right solution. Kindly help and point out my mistake in the approac h adopted. Regards, Pooja
Re: Modulo A rithmetic Remainder Theory by a m it pra k a sh - W e dne sda y, 16 July 2008, 01:04 AM hi sir...........im a m it.....the wa y yo u a re so lving d pro ble m s is e x ce lla nt...its ro ck ing sir.... Sir i didnt unde rsta nd the Eule r's the o re m pro pe rly.....m a inly the se co nd line o f the first e x a m ple ........plz e x pla in a ga in........
Re: Modulo A rithmetic Remainder Theory by inde rpre e t m a k k a r - T hursda y, 17 July 2008, 06:29 AM
25/50
3/1/2014
Hey FB U truly are a bond w i th hell lot of fundas... Thnx. IPS.
Re: Modulo A rithmetic Remainder Theory by pre m de e p singh - T hursda y, 24 July 2008, 09:16 AM sir,plz give ide a ho w to so lve a run sha rm a so lutio n wha t will be re m a inde r 2^2+22^2+222^2 + 2222^2+................+(222........48tim e s)^2%9
Re: Modulo A rithmetic Remainder Theory by pre m de e p singh - W e dne sda y, 30 July 2008, 11:22 AM hi guy plz a cce pt cha lle nge ca t2008 no v16 wha t is re m a inde r 2^2+22^2+222^2+2222^2.......................+(222......49 tim e s )^2%9
Re: Modulo A rithmetic Remainder Theory by sa hil a ro ra - W e dne sda y, 30 July 2008, 07:54 P M
Gre a t wo rk Bo ss..U r truly T G(to ta l ge nius.... Fa nta stic,Mindblo wing!!!!!
Re: Modulo A rithmetic Remainder Theory by sa hil a ro ra - W e dne sda y, 30 July 2008, 08:25 P M hi... co uld yo u ple a se e la bo ra te m o re in so lving the a bo ve que stio n..
(ii) remainder of 2 ^1990 / 1990 1990=2.5.199 from Euler's Theorem phi(2)=1 phi(5)=4 phi(199)=198 ////////// ac c ording to euler's theorm remainder of [2^phi(2) / 2] = 2^1 /2 c omes out to be 1 but its zero..c ould u please c orrec t me if m interpreting it wrong and please throw some light on the part right below..that LCM and mod thing ...unable to get it... //// 2^4=1 mod 5--------(1) 2^198=1 mod 199---------(2) LCM(4,198)=396 so 2^396=1 mod 1990 2^1980=1 mod 1990(bec ause 1980 is a multiple of396) so now we remain with 2^10 mod 1990 1024 mod 1990=1024
26/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by sa nje e v ga ne sh - Sa turda y, 9 August 2008, 02:47 P M
Hi AD P, Anwer to the (2^1990 % 1990) is impressive, but c an you explain step LCM(4,198). Why did you take LCM ? Sanjeev
Re: Modulo A rithmetic Remainder Theory by Ana m ica Sinha - Sunda y, 10 August 2008, 02:20 AM tha nk s a lo t.....!!!!!!! It's re a lly a gre a t he lp ... fo r we do n't find the se so rt o f stuffs in bo o k s e a sily.... tho ugh a bit co nfusing a t first ..... W ith so m a ny the o re m s to so lve sim ila r Q ua nts que stio n .... it's a bit to ugh to judge which o ne to a pply... witho ut m uch pra ctice ....
Re: Modulo A rithmetic Remainder Theory by sa nde e p she k ha r - Sa turda y, 16 August 2008, 04:24 P M T ha nk s a lo t!I a lwa ys wo nde re d ho w to a nswe r such que stio ns.T his a rticle wa s wo nde rful.do k e e p po sting such a rticle s.
Re: Modulo A rithmetic Remainder Theory by a nju m o r - Sunda y, 17 August 2008, 02:46 P M
P LZ te ll m e so m e 1 ho w to so lve ......... 1. (100/62)^1/4 2. (100/62)^1/5 3. (100/62)^1/6

Re: Modulo A rithmetic Remainder Theory by a nju m o r - Sunda y, 17 August 2008, 02:47 P M
P LZ te ll m e so m e 1 ho w to so lve ......... 1. (100/62)^1/4 2. (100/62)^1/5 3. (100/62)^1/6

Re: Modulo A rithmetic Remainder Theory by a bha y de o l - Mo nda y, 18 August 2008, 12:21 AM he llo T G sir do u ha ve ha rd co py o f yo ur bo o k o n num be rs....o r do u ha ve o nly the e bo o k o ptio n...nd sir whe re a re the a ns o f the se quizze s a nd la stly sir do yo ur co a ching cla sse s pro vide a ny study m a te ria l by co rre spo nda nce ...if so m e o ne do e snt wa nt to a tte nd cla sse s.... sir do re ply
Re: Modulo A rithmetic Remainder Theory by sa nje e v ga ne sh - Mo nda y, 25 August 2008, 05:12 P M I ha ve a que ry. In ca se o f Chinnese method: 1. Do we ne e d to che ck whe the r the num be r a nd diviso r to be co -prim e 2. If ye s, ca n yo u e x pla in m e yo ur la st e x a m ple 8^643 / 132 using C hinne se m e tho d P le a se e x pla in
C he e rs, Sa nje e v
27/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by sa nje e v ga ne sh - T ue sda y, 26 August 2008, 04:11 P M
Thank you for this beautiful artic le, What is the remainder inc ase of 13^40 mod 49 ? Cheers, Sanjeev
Re: Modulo A rithmetic Remainder Theory by a run ila ngo va n - W e dne sda y, 27 August 2008, 05:19 P M hi, this is m y first po st to T G... (2^2 + 22^2 + 222^2...(2222...48tim e s)^2) % 9 [(4*(1^2) + 4(11^2) + 4(111^2)...] %9 4[1^2 + 11^ 2 + 111^ 2...] % 9 4[1 + (9+2)^2 + (108+3)^2...] % 9...(a ll te rm s o f fo rm (a +b)^2, whe re a is a m ultiple o f 9, lik e 9, 108, 1107...) 4[1^2 + 2^2 + 3^2+...+48^2} % 9 .........(since a ll te rm s o f fo rm a ^2+2a b a re divisible by 9) [4*48*49*97/6] % 9 re m a inde r = 5... ple a se le t m e k no w if this is co rre ct...
Re: Modulo A rithmetic Remainder Theory by a run ila ngo va n - T hursda y, 28 August 2008, 11:57 AM (13^40) % 49 this ca n be writte n a s... =[(2*7-1) ^40] % 49 By bino m ia l e x pa nsio n... =(2*7)^40-40C 1 * (2*7)^39 (1)...40C 39 * (2*7)(-1)^39 + (-1)^40 a ll the o pe ra nds in the a bo ve e qua tio n e x ce pt fo r the la st two a re divisible by 49. So we ne e d to find the re m a inde r, whe n the la st two te rm s a re divide d by 49. => -560 % 49 + 1 =7 * (40 * -2)%7 + 1 =7 * (-10) + 1 = -70 + 1 = -69 = 49*2 - 69 =29 He nce the re m a inde r is 29.... So m e bo dy ple a se le t m e k no w if this is the right a nswe r...
Re: Modulo A rithmetic Remainder Theory by Muk e sh Kum a r - Sa turda y, 6 Se pte m be r 2008, 06:14 P M do n't ha ve wo rds to e x pla in the be a uty o f this a rticle ..so lve d so m e difficult que stio n with in se co nd...tha nk s fo r this
Re: Modulo A rithmetic Remainder Theory by A K - Sa turda y, 13 Se pte m be r 2008, 09:49 P M
28/50
3/1/2014
T he a rticle ha s m a de life a bit e a sie r whe n it co m e s to re m a inde rs.
Re: Modulo A rithmetic Remainder Theory by nim ish vik a s - Sunda y, 14 Se pte m be r 2008, 12:16 AM tha nk yo u fa ndu bo nd fo r this co m pila tio n a nd yo u e ffo rts nim ish
Re: Modulo A rithmetic Remainder Theory by a nju m o r - Frida y, 19 Se pte m be r 2008, 12:19 P M gud m o rning... I ha ve so m e pro ble m s plz so lve . 1. Find re m a inde r whe n [(1^1+2^2+3^3+.....+9^9)+(10^9-11^8+12^7-13^6+14^5.....+18^1)] divide d by 19. 2. First 99 na tura l num be rs a re writte n side by side to fo rm a num be r. 1234567891011............9899 find re m a inde r whe n this num be r is divide d by 11. 3. C o nside r a 21 digit no . 12345678........ Find re m a inde r whe n divide d by 11.
Re: Modulo A rithmetic Remainder Theory by De ba shish ... - Sa turda y, 20 Se pte m be r 2008, 06:15 P M hii...a nju...is d a nswe r o f d 1st que stio n 0?? i ha ve so lve d it a s fo llo ws.. give n e x pre ssio n ca n be writte n a s: (1^1+18^1)+(2^2-17^2)+...+(9^9+10^9) Since ,(a ^n+b^n) is divisible by a +b whe n n is o dd, (a ^n-b^n) is divisible by a +b whe n n is e ve n... He nce ...the te rm s in e a ch o f the bra ck e ts a bo ve a re divisible by 19...He nce the re m a inde r is 0.
Re: Modulo A rithmetic Remainder Theory by De ba shish ... - Sa turda y, 20 Se pte m be r 2008, 07:09 P M 3. I ha ve so lve d this pro ble m using re m a inde r the o re m a nd go t the a nswe r 7. is it co rre ct? 1234...21digits =12345678910...15 =(15*10^21+14*10^19+13*10^17...10*10^11)+(9*10^8+8*10^7+...1) (i) (ii) a pplying re m a inde r the o re m ,since ,11=10+1, substitute -1 in pla ce o f 10 in the a bo ve po lyno m ia l in 10... we ge t,a s re m a inde r, =-(15+14+13+....10)+(9-8+7-6+...+1) (i) (ii) =-70. No w the fina l a nswe r will be the re sult o f (-70 m o d 11)=7,in dis ste p i ha ve writte n -70 a s (10*70)m o d 11 =7.(a s re m a inde r o f -1 m e a ns 10 in this ca se ).Dunno if i a m co rre ct[ ]...Do co rre ct m e if i'm wo rng sum whe re ...thnk ss.
Re: Modulo A rithmetic Remainder Theory by a a rti k a ushik - Sa turda y, 20 Se pte m be r 2008, 11:49 P M T hnx s T G. P lz so lve m y pro ble m .
Q.1 What is the remainder when (1!)^3 +(2!)^3 +(3!)^3 +(4!)^3 + ----------------------(1152!)^3 is divided by 1152?????? Q.2 What is the remainder when 2(8!) -21(6!) divides 14(7!) + 14(13!)?????????????????????
W a iting fo r ur re ply.
29/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by yo g ba nsa l - Sunda y, 21 Se pte m be r 2008, 12:58 AM Ans 2:- 2(8!)-21(6!) = 2(8!)-3.7.(6!) o r = 2.8.(7!)-3.(7!) o r = 13(7!) No w, re m a inde r o f 14(7!) + 14(13!) = re m a inde r o f 14(7!) + re m a inde r o f 14(13!) o r =14/13 + 0 o r =14/13 (a ns.)
Re: Modulo A rithmetic Remainder Theory by yo g ba nsa l - Sunda y, 21 Se pte m be r 2008, 01:15 AM
Q.1 What is the remainder when (1!)^3 +(2!)^3 +(3!)^3 +(4!)^3 + ----------------------(1152!)^3 is divided by 1152??????
Ans 1 :- 1152 = 2^7 . 3^2 T he re fo re , we ca n e a sily ca lcula te the re m a inde r o f e a ch te rm individua lly he re . e .g. a ll te rm s a fte r (3!)^3 a re co m ple te ly divisible by 1152 he nce , the re m a inde r is 225 (which is e qua l to the re m a inde r o f the sum o f first 3 te rm s).........Ans
Re: Modulo A rithmetic Remainder Theory by a nju m o r - Sunda y, 21 Se pte m be r 2008, 04:00 P M de ba shish tha nk s fo r d so lutio n.........
Re: Modulo A rithmetic Remainder Theory by a a rti k a ushik - Sunda y, 21 Se pte m be r 2008, 05:10 P M T hnx s, I ve a no the r pro ble m . Q .1 Find the 28383rd te rm o f the se rie s: 12345678910111112...........??????
Re: Modulo A rithmetic Remainder Theory by m o hit sa x e na - Sa turda y, 18 O cto be r 2008, 01:32 AM 777^777 /1000 1000 & 777 a re co prim e we a pply e ule r th. 1000(1-1/2)(1-1/5)=400 777^400 /1000 give s re m 1 no w le ft with 777^347 /1000 1000= 8*125 we divide se pe ra te ly by 8 & 125 777^777 /8 1^777 /8 =1 re m 777^777 /125 777^100 will give re m 1 (a plying e ule r) 777^700 will a lso give re m 1 no w le ft wid 777^77 /125
30/50
3/1/2014
27^77/125
3^231/125 3^100 will give re m 1 (e ule r th.) 3^31 /125 (3^5)^6 *3 /125 (-7)^6 * 3 24 *3 / 125 =72 so re m = 72 no w using chine se 8x +1= 125 y + 72 x =(125y+71)/8 =(5y+7)/8 =y=5 put y in (125 y +72) 125*5+72=697 697 is the a ns
bha i m a rna m a t ga lt ho to ..........

Re: Modulo A rithmetic Remainder Theory by pra ve sh bhuto ria - T ue sda y, 21 O cto be r 2008, 03:08 AM hi tg, Q UES.find the la st digit o f the pro duct o f a ll 2 digit num be rs tha t give a re m a inde r o f 2 whe n divide d by 5?
Re: Modulo A rithmetic Remainder Theory by So ftwa re Engine e r - T ue sda y, 21 O cto be r 2008, 12:22 P M pra ve sh, Is it 6? - SE
Re: Modulo A rithmetic Remainder Theory by T G T e a m - W e dne sda y, 22 O cto be r 2008, 12:07 P M Hi P ra ve sh Q UES.find the la st digit o f the pro duct o f a ll 2 digit num be rs tha t give a re m a inde r o f 2 whe n divide d by 5? Sm a lle st a nd la rge st two digit num be r which give a re m a inde r o f two whe n divide d by 5 a re 12 a nd 97 re spe ctive ly. So to ta l such num be rs a re = (97-12)/5 + 1 = 18 e a ch giving a re m a inde r two . He nce pro duct o f la st digits o f a ll the se 18 num be rs = 2 9*7 9 = 2*7 = 4
Re: Modulo A rithmetic Remainder Theory by T G T e a m - W e dne sda y, 22 O cto be r 2008, 12:26 P M Hi P ra ve sh Q UES.find the la st digit o f the pro duct o f a ll 2 digit num be rs tha t give a re m a inde r o f 2 whe n divide d by 5? Sm a lle st a nd la rge st two digit num be r which give a re m a inde r o f two whe n divide d by 5 a re 12 a nd 97 re spe ctive ly. So to ta l such num be rs a re = (97-12)/5 + 1 = 18 e a ch giving a re m a inde r two . He nce pro duct o f la st digits o f a ll the se 18 num be rs = 2 9*7 9 = 2*7 = 4
Re: Modulo A rithmetic Remainder Theory by T G T e a m - W e dne sda y, 22 O cto be r 2008, 12:36 P M Hi P ra ve sh Q UES.find the la st digit o f the pro duct o f a ll 2 digit num be rs tha t give a re m a inde r o f 2 whe n divide d by 5? 2 9*7 9 = 2*7 = 4
31/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by So ftwa re Engine e r - W e dne sda y, 22 O cto be r 2008, 06:39 P M o f the pro duct o f a ll 2 digit num be rs.......... I m isse d '2 digit' pa rt a nd go t 2^10 * 7^10 = 4*9 = 6
Re: Modulo A rithmetic Remainder Theory by pra ve sh bhuto ria - T hursda y, 23 O cto be r 2008, 01:53 AM hi k a m a l,tha nk s fo r a tte m pting this que s, but i wa s no t a ble to unde rsta nd the lo gic be hind (97-12)/5 + 1 such num be rs a nd ho w co m e the re pro duct will be 2 9*7 9. so will u pls e x pla in it tho ro ughly?
Re: Modulo A rithmetic Remainder Theory by pra ve sh bhuto ria - T hursda y, 23 O cto be r 2008, 03:45 AM hi tg sir, i ha ve a co nce ptua l do ubt.wha t if, in chine se re a inde r the o re m , N=a *b*c. T ha t is N ha s 3 prim e fa cto rs.ca n the chine se re m a inde r the o re m still be a pplie d.if so the n ho w?wha t a bo ut a x +by=1 in tha t ca se ?
Re: Modulo A rithmetic Remainder Theory by T G T e a m - T hursda y, 23 O cto be r 2008, 03:51 P M Hi P ra ve sh Le t's ta k e a n e x a m ple : W ha t'll be the re m a inde r whe n 1111... 2008 times is divide d by 1001? No w le t the num be r is N. Also 1001 = 7*11*13 So N = 4m o d7 = 0m o d11 = 11m o d13 . Using. 2*(11) - 3*(7) = 1 => N = (2*11*4 - 3*7*0)m o d77 = 11m o d77 Using, (13)*6 - (11*7) = 1 => N = (13*6*11 - 11*7*11)m o d1001 = 11m o d1001.
Re: Modulo A rithmetic Remainder Theory by P ushpe nde r P a nnu - T ue sda y, 31 Ma rch 2009, 10:12 P M he llo ca n a nybo dy he lp m e o f 63 is give n a s 18. It sho uld be 36?
Re: Modulo A rithmetic Remainder Theory by Ank ita C ho wdhury - W e dne sda y, 1 April 2009, 08:33 AM Hi P ushpe nde r, 63=3^2*7 phi(63) = 63(1-1/7)(1-1/3) = 36*6/7*2/3 = 36
Re: Modulo A rithmetic Remainder Theory by sa nje e b pa nda - Sa turda y, 4 April 2009, 08:51 AM T ha nk s Sir fo r the se trick s a nd e x a m ple s.. P ls sir write a s m uch a s po ssible be co z it he lps to us tho se who a re una ble to ta k e o r a dm it into yo ur cla ss ro o m co a ching.
T ha nk s Sir.
32/50
3/1/2014
remainder of 2 ^1990 / 1990? by k unda n k um a r - T ue sda y, 21 April 2009, 02:12 AM ple a se e x pla in we re m i go in wro ng 2^1989/995 2^1980 * 2^9/995 2^1980 * 2^9/5*199 [no w by e ule rs the o re m 2^1980 le a ve s re m a inde r 1 whe n divide d by 199 ( phi(199)=198) ] the re fo re we r le ft with 2^9/5 which le a ve s re m a inde r 2 but re a ding the a bo ve thre a d 1024 is the co rre ct a ns...
Re: Modulo A rithmetic Remainder Theory by Vibho r Go ya l - Sunda y, 10 Ma y 2009, 01:40 P M Hi Ka m a l/T G sir I ha ve a do ubt in the so lutio n pro vide d fo r the re m a inde r whe n 1111... 2008 times is divide d by 1001. In the 5th line o f the so lutio n, the re m a inde r whe n 1111... 2008 times is divide d by 7 is ta k e n a s 4. T he va lue a s pe r m y ca lcula tio n is 5..ca n yo u pls te ll m e whe re im m a k ing a m ista k e ??wha t i did wa s: with 1 -> 1 11 -> 4 111 - 6 1111 - 5 11111 - 2 111111 - 0 1111111 - 1 a nd so o n.. he nce fo r 2008 tim e s digit 1, re m a inde r sho uld be 5. rgds
Re: Modulo A rithmetic Remainder Theory by Go wtha m Muthuk k um a ra n T hiruna vuk k a ra su - W e dne sda y, 13 Ma y 2009, 05:47 P M ho w to so lve (i) find the re m a inde r o f 55555 .... 93 tim e s divide d by 98 55555.........93 tim e s = 5( 1+10+100+........+10^98) = 5((10^99)-1)/ (10-1) the re fo re , the re m inde r whe n the num be r is divide d by 98 is, = 5*10^99/(9*98) - 5/(9*98) = 0 I ho pe tha t this is right. If the num be r wa s prim e the n u co uld use the co nce pt tha t a ny single digit num be r re pe a te d 'n' tim e s is divisible by 'n' pro vide d 'n'is prim e .
Re: Modulo A rithmetic Remainder Theory by Ashuto sh Singh - Mo nda y, 18 Ma y 2009, 12:49 P M R e a lly a ve ry he lpful a nd e ffe ctive a rticle . An e ye o pe ne r
Re: Modulo A rithmetic Remainder Theory by va k a ti ba bu - T hursda y, 28 Ma y 2009, 09:35 P M fo r the ve ry first que stio n 5^37 / 63 ho w f(63)=63*(1-1/3)*1-1/7=18 . it is 36 ho w it is co nfirm e d tha t 5^18/63 re m a inde r is 1
Re: Modulo A rithmetic Remainder Theory by va k a ti ba bu - W e dne sda y, 3 June 2009, 12:09 AM
33/50
3/1/2014
in e ule r's the o re m ca n so m e o ne ple a se e x pla in the ca lcula tio n o f the fucntio n pi( n)
Re: Modulo A rithmetic Remainder Theory by Na ba nshu Bha tta cha rje e - W e dne sda y, 10 June 2009, 11:59 P M I a ppro a ch such pro ble m s, in which the num e ra to r a nd the dino m ina to r ha s so m e co m m o n fa cto rs, in the fo llo wing wa y 1) ta k e the co m m o n fa cto rs o ut i.e . divide bo th num e ra to r a nd dino m ina to r by the ir HC F 2)Find the re m a inde r( no w the num e ra to r a nd the dino m ina to r wo uld be co -prim e s) 3) m ultiply the re m a inde r with the HC F So in this pro ble m , we ca n write 2 1990 = 2* 2 1989 1990=2*5*199 phi(5) =4 phi(199) =198 LC M(4,198) =396 the re fo re 2 396 = 1 m o d 995 the re fo re re m a inde r whe n 2^1989 divide d by 995 is 2 9 he nce the re quire d re m a inde r is 2*2 9 I think this cle a rs a lo t o f clo ud o n the the o ry be ing a pplie d he re I a m ne w he re ...co rre ct m e if I a m wro ng
Re: Modulo A rithmetic Remainder Theory by Na ba nshu Bha tta cha rje e - T hursda y, 11 June 2009, 12:21 AM 1001 is a be a utiful num be r. a ny thre e digit num be r m ultiplie d by 1001 re sults in the num be r writte n twice i.e . a bc * 1001 =a bca bc in the pro b 1111...2008 tim e s is divide d by 1001 111111 is divisible by 1001( 111 * 1001) tha t m e a ns 111.....2004 tim e s wo uld be divisible by 1001 (111111* 1000001000001000....e tc) tha t wo uld le a ve us with 1111 the re m a inde r wo uld be 110
@pra ve sh I think the be st a ppro a ch in such ca se s is by ta k ing LC Ms, a nd the n ge tting a sm a lle r num be r to divide
Re: Modulo A rithmetic Remainder Theory by Na ba nshu Bha tta cha rje e - T hursda y, 11 June 2009, 12:24 AM Ha ve a cra ck a t this re m a inde r whe n 72! is divide d by 73*36! (I do nt k no w whe re this pro ble m a ppe a rs. I go t this fro m a frie nd thro ugh SMS. Ho pe fully I a m no t infringing a ny co pyright )
Re: Modulo A rithmetic Remainder Theory by Sa i Shya m Ko la cha la m a - Sa turda y, 13 June 2009, 09:48 P M
T ha nk s a m illio n ... I a lwa ys wa nte d to k no w ho w to so lve the se k ind o f pro ble m s...
... T G .. u R o ck ...
.... a nd fundo o ... u
rule ..
34/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by ne ha la ho ti - Sunda y, 14 June 2009, 01:53 AM Hi T G i use d so m e o the r m e tho d to so lve 32^32^32 whe n divide d by 9, by m y m e tho d i a m ge tting re m a inde r =2 whe n 32^32^32 is divide d by 9. we ca n write the que stio n a s 2^5^32^32 whe re 5^32^32 ca n be wriite n a s 3k +1 whe re k is a n e ve n num be r. so no w 2^3k +1 divide d by 9 will give yo u 2 a s the re m a inde r.C o uld yo u ple a se po int o ut m y m ista k e .
Re: Modulo A rithmetic Remainder Theory by Kulvir Singh - Sunda y, 14 June 2009, 12:35 P M @ Ne ha Just think a bo ut this que stio n a nd yo u will ge t whe re yo u a re wro ng.. (8)^2=(2^3)^2=2^(3*2)=2^6 No w wha t yo u did wro ngly wa s writing the give n que stio n a s 2^5^32^32 whe re a s it sho uld ha ve be e n (2^5)^32^32 = 2^[5*(32^32)]
Re: Modulo A rithmetic Remainder Theory by ne ha la ho ti - Mo nda y, 15 June 2009, 12:29 P M Hi Kulvir. T ha nk yo u fo r the so lutio n.I ha ve a do ubt which is: (111..7) tim e s whe ndivide d by 7 will give a re m a inde r 1 a nd if (111..14 )tim e s will a lso give the re m a inde r a s 1 whe n divide d by 7.?Is this co rre ct. C o uld yo u e x pla in m e the lo gic be hind the chine se the o re m . I m e a n ho w is it de rive d since thr ha s to be a lo gic be hind...tha nk s
Re: Modulo A rithmetic Remainder Theory by Kulvir Singh - T ue sda y, 16 June 2009, 01:40 P M @ ne ha Its a n e x te nsio n o f the a ctua l the o re m sta ting tha t 111111 will be co m ple te ly divisible by 7...So ,use it in this fo rm o nly..T his a uto m a tica lly a nswe r yo ur se co nd que stio n tha t 111...(14 tim e s) will a ctua lly give a re m a inde r o f 11 i.e . 4 with 7..It's be tte r fo rm o f the sa m e the o re m na ..?? I do nt k no w the e x a ct pro o f,but i ca n te ll yo u the lo gic be hind this.. 10^6 will give m e a re m a inde r o f 1 with 7(fe rm e t's the o re m ) He nce 10^6-1 sho uld be divisible by 7.. He nce 999999 sho uld be divisible by 7.. 9*111111 m ust be divisible by 7... Since 9 is no t divisible by 7,111111 sho uld be divisible by 7.. And he nce 222222,333333 a nd so o n will a ll be divisible by 7.. T he sa m e ca n be e x te nde d by to a ll prim e num be rs..
Re: Modulo A rithmetic Remainder Theory by ne ha la ho ti - T ue sda y, 16 June 2009, 05:56 P M Hi T G T ha nk s...T his site is 2 gud 2 b true !!1 m o re do ubt! #ho w m a ny pa irs o f x a nd y e x ist fo r which the e q: sqrt X + sqrt Y = Sqrt 1332 ho lds true .C o uld yo u plz so lve it.It is o ne o f the que stio ns fro m T G quizze s.Are so lutio ns give n to the quizz pro ble m s o n the site ? T ha nk s
Re: Modulo A rithmetic Remainder Theory by Kulvir Singh - W e dne sda y, 17 June 2009, 09:07 AM @ ne ha T he a nswe r will be 5...T he so lutio n a re no t the re in tha t quiz...Actua lly i wo uld sugge st T G to m a k e the so lutio ns a va ila ble be ca use tha t wa y we ca n le a rn va rio us a pro a che s to so lve the pro ble m s o n va rio us co nce pts...[And he y!!Y o u ca n e ve n cha rge so m e chho ti c a m o unt fo r tha t... ]
35/50
3/1/2014
W e ll no w ta k ing o ve r the busine ssm a n pa rt o f m e ,the so lutio n fo r this que stio n... rhs o f the que stio n a fte r fa cto risa tio n give s m e sqrt(36*37) T ha t ca n be writte n a s 6sqrt(37) No w e k chho ta ca co nce pt...If the rhs o f the e qua tio n ha s sqrt o f 37,bo th sqrt(x ) a nd sqrt(y) shud ha ve sqrt(37) in it... No w the que stio n re duce s to a sqrt 37 + b sqrt 37= 6 Sqrt 37 He nce a +b=6 (a ,b) ca n be 1,5 ;2,4; 3,3; 4,2; 5,1 And subse que ntly,va lue o f X a nd Y ca n be fo und o ut...Ho pe i a m cle a r...!!
Re: Modulo A rithmetic Remainder Theory by Kulvir Singh - W e dne sda y, 17 June 2009, 09:42 AM @ re m a inde r whe n 72! is divide d by 73*36! T he a nswe r will be 27*36!
Re: Modulo A rithmetic Remainder Theory by Na ba nshu Bha tta cha rje e - Sa turda y, 20 June 2009, 04:09 P M Ho w did yo u ge t it?
Re: Modulo A rithmetic Remainder Theory by Anto nio Ba nde ra s - W e dne sda y, 24 June 2009, 03:37 P M go o d a rticle ..che e rs ca n a nyo ne he lp m e with this?? find 28383rd te rm o f the fo llo wing 123456789101112... o ptio ns a re 3,4,9,7.. m y a nswe r is co m ing 3..but its wro ng did it by ta k ing 1-9-->9*1digits 10-99-->90*2=180digits 100-999-->900*3=2700digits to ta l=2889digits o f 1,2 a nd 3 digit num be rs. so , 4digit num be rs will ha ve 28383-2889=25494digits so the a ctua l num be r will be 999+[25494/4]=7372 while dividing with 4 we ge t re m a inde r 2 so the re quire d digit is go ing to be 3 a s we 'll ha ve 7 3 7 2 7 3 7 3...a nd so o n wha t a m i do ing wro ng??
Re: Modulo A rithmetic Remainder Theory by k a rtik ja ni - T hursda y, 25 June 2009, 02:37 P M by the wa y... 63(1-1/7)(1-1/3) = 36 no t 18 a s u m e ntio ne d a fte r intro ducing the first the o re m k indly m a k e the ne ce ssa ry cha nge s if po ssible ... a ve ry nice a rticle tho ugh m o re o f the se e x pe cte d.... a lso wa t will be the re m a inde r if 34! is divide d by 73... so m e quick a nd he lpful m e tho d pls
Re: Modulo A rithmetic Remainder Theory by Ahe fa z Kha n - T hursda y, 25 June 2009, 09:16 P M T his is by fa r the be st a rticle I ha ve e ve r a nd will e ve r co m e a cro ss. I a m a busine ss jo urna list a nd just wo nde r why a re yo u pe o ple ta k ing a m e a sure d a ppro a ch a nd no t co m ing o ut in a big wa y whe n e ve ry to m , dick a nd ha rry is re so rting to e ve ry po ssible gim m ick to re a ch o ut to C AT a spira nts.
Re: Modulo A rithmetic Remainder Theory by Kulvir Singh - Frida y, 26 June 2009, 09:18 AM 34! is divide d by 73 T he a nswe r will be 36...No quick m e tho d to ge t this o ne ...Y o u will ha ve to inve st a go o d 3,4 m inute s to re a ch to the a nswe r..
36/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by Kulvir Singh - Frida y, 26 June 2009, 09:23 AM @ Anto nio Ba nde ra s I gue ss yo u ha ve se e n this que stio n in Arun sha rm a we re in the a nswe r m ight be give n a s so m e thing o the r tha n 3...But yo ur a ppro a ch a nd a nswe r is co rre ct...Eve n i a m ge tting the a nswe r to be 3 o nly..I think the a nswe r is wro ng..Kindly te ll fro m whe re yo u ha ve ta k e n this que stio n so tha t the cre dibility o f a nswe r be ve rifie d..
Re: Modulo A rithmetic Remainder Theory by Anto nio Ba nde ra s - Frida y, 26 June 2009, 01:22 P M ye a h its fro m Sha rm a ..whe re the a nswe r is 9.. he re 's a no the r sum p=1!+2*2!+3*3!+........+12*12! wha t'll be the re m a inde r whe n p+3 is divide d by 13!? m y a ppro a ch is this fo r a ny num be r we ca n use the fo llo wing whe n we ha ve 1!+2*2!+3*3!+.....+(n-1)(n-1)! this fo rm a nd it is divide d by n! the re m a inde r is -1... (e g o f -ve re m a inde r: if we ha ve 23/6, we ca n e x pre ss 23 a s 6*4-1(6k -1) o r we ca n e x pre ss 23 a s 6*3+5(6k 1+5) ) e g: a s in 1!+2*2!+3*3! whe n divide d by 4! will give 23/24... he re re m a inde r is 23 which we ca n write a s 24k -1...so i write the re m a inde r a s -1...thus 23=4!-1 thus in the give n sum p/13! will give re m a inde r a s -1 a nd 3/13! will give re m a inde r 3.. thus the re m a inde r sho uld be 3-1=2.... i ho pe m y m e tho d is o k ..i do n't ha ve the a nswe r to this. if a nyo ne ge ts a diffe re nt a nswe r to this o r ha s a diffe re nt m e tho d ple a se do sha re ...
Re: Modulo A rithmetic Remainder Theory by sriniva sa n ra vi - Sa turda y, 27 June 2009, 12:31 P M hi a ll, a nyo ne pls he lp m e to so lve this pro ble m , if x = 777...777 ( 101 7 a re the re ) the n wha t is x m o d 440 ? tha nk s..
Re: Modulo A rithmetic Remainder Theory by Anto nio Ba nde ra s - Sa turda y, 27 June 2009, 01:09 P M we ll he re x will be divisible by 440 if it is divisible by 4,11,10(440=4*11*10). 11's divisibility rule is (sum o f o dd digits)-(sum o f e ve n digits)=0/11k he re if we ta k e 98 7's the n we ha ve the fo llo wing 777777......98digits000+777 the num be r 77777....98digits000 is divisible by 11(49*7-49*7=0) is divisible by 4(e nding with 3 0's) is divisible by 10. so a nswe r sho uld be re m a inde r o f 777/440 =(777-440)= 337 is this the a nswe r??
Re: Modulo A rithmetic Remainder Theory by Kulvir Singh - Sa turda y, 27 June 2009, 02:12 P M Y o ur a ppro a ch to bo th the que stio ns is co rre ct...And bo th the a nswe rs a re a lso co rre ct..
Re: Modulo A rithmetic Remainder Theory by sriniva sa n ra vi - Sunda y, 28 June 2009, 08:36 P M
37/50
3/1/2014
tha nk yo u a nto nio ..this is the a nswe r..tha nk s a lo t..
Re: Modulo A rithmetic Remainder Theory by Na ba nshu Bha tta cha rje e - Mo nda y, 29 June 2009, 01:55 AM Kulvir, a bo ut the pro b 72! divide d by 36! 73 T he a ppro a ch i fo llo we d is, ta k e 36! o ut fro m bo th the num e ra to r a nd de no m ina to r, T he ne w num e ra to r, 37.38.39.....72 ,le t us ca ll it A,ca n be writte n a s (73-36)(73-35)(73-34) e tc, So A% 73 is sa m e a s 36! % 73., le t us ca ll it x He nce the Answe r to the pro ble m is 36!x No w, 72!/73 is -1 o r 72 i.e . 36!.A %72 = -1 o r 72 i.e x ^2%73 is -1 o r 72 1.e x ^2 = 73k - 1 I to o go t 27 by inspe ctio n, but tha t is to o te dio us. P le a se sha re yo ur a ppro a ch.
Re: Modulo A rithmetic Remainder Theory by a bin a bra ha m - Mo nda y, 29 June 2009, 09:17 P M Just Ma rve llo us m o st re m a inde r que stio ns ha d m e stum pe d e ve n be fo re i cd sta rt think in o n the m nw i ve go t rt d co nce pts
Re: Modulo A rithmetic Remainder Theory by Kulvir Singh - Mo nda y, 29 June 2009, 11:43 P M W e ll i a lso did so m e thing sim ila r but a bit sm a lle r. But be fo re go ing into the so lutio n,i wo uld lik e to put fo rth tha t such que stio ns a re ve ry le ss lik e ly to co m e in a n e x a m lik e C AT be ca use the re is no sho rt m e tho d to so lve it. Its just a m a tte r o f a n e pipha ny. W e ll he re is m y a ppro a ch.. 72!m o d73 = -1 (72*71*70*.......36*35*34*.....*2*1)m o d73 = -1 (-1*-2*-3*-4........-35*-36)*(36*35*....2*1)m o d73=-1 (36!*36!)m o d73=-1 (36!)^2m o d73=-1 No w he re is the ca tch..T o m e ,it struck by cha nce tha t since 27*27=729 give s a re m a inde r o f -1 with 73, (36!)m o d73 will be 27.. He nce 34!*35*36m o d73 = 27 34!*19 m o d 73=27 19a =73b-27 Fro m he re ,va lue o f b will be 9... And he nce ,a is 36.. Q uite a lo ng so lutio n a ctua lly...
Re: Modulo A rithmetic Remainder Theory by a rvind k um a r - T hursda y, 2 July 2009, 12:13 P M be a utifull e x pla ina tio n tha nk yuo u so s o m uch.
Re: Modulo A rithmetic Remainder Theory by C hing Le e - Frida y, 3 July 2009, 12:45 P M
@ Gowtham Muthukkumaran Thirunavukkarasu with regard to ur solution dated 13 May,2009....

3/1/2014
Could u pls explain the last step of ur answer i.e. Remainder of 5*10^99/(9*98) - 5/(9*98) =0 How c ome?
Re: Modulo A rithmetic Remainder Theory by C hing Le e - Frida y, 3 July 2009, 12:52 P M
@ Nabanshu Bhattac harjee c ould you pls throw some more light on the LCM approac h that you have mentioned in one of ur posts. There is only 1 example whic h everyone has repetitively explained for the LCM approac h. Could u give me any other example wherein u hv used this approac h. @ all or maybe someone else has other examples .
Re: Modulo A rithmetic Remainder Theory by Sidha nt Ba nsa l - Frida y, 17 July 2009, 04:24 AM tha nx a lo t T G.... a we so m e stuff !!
Re: Modulo A rithmetic Remainder Theory by Ma nish Kum a r - Sa turda y, 18 July 2009, 05:50 P M Hi, Gr8 a rticle ... Ha d fe w do ubts in the a bo ve e x pla na tio n o f e x a m ple in Eule r's T he o : 1) Ho w co m e 63(1-1/3)(1-1/7)=18 a nd no t 36? 2)1000(1-1/2)(1-1/4)=400 a nd no t 375? T ha nk s, Ma nish.
Re: Modulo A rithmetic Remainder Theory by ta run bha vna ni - Frida y, 24 July 2009, 02:03 P M just did the e x e rcise .. u ve m a de finding re m a inde r so e a sy...thnx T G...
Re: Modulo A rithmetic Remainder Theory by Astha Ja la n - Mo nda y, 27 July 2009, 10:53 AM He y, Ho do we find the re m a inde r o f 12^107 / 37 ? tha nk s!
Re: Modulo A rithmetic Remainder Theory by ro na k pa te l - Mo nda y, 27 July 2009, 05:59 P M hi.. is tha t a ns 1? by e ule r's the o re m phi(37)=36 the re fo re re m [12^36/37]=1 no w re m [12^107/37]=re m [{12^(36)*3}/37]*re m [12^-1/37] =1*re m [1/12*37] =1 a m i right?if wro ng so m e whe re m a k e m e no tice it...
39/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by sha lin ja in - Mo nda y, 27 July 2009, 08:23 P M --find the re m a inde r o f 55555 .... 93 tim e s divide d by 98 T his que stio n wa s a sk e d by Mr. Subha de e p da s, 2 yrs ba ck , o n 28th Se pte m be r 2007. I think it ha d be e n lo st in the "de luge " o f T G fo llo we rs' que rie s .
First o f a ll,Mr. Go wtha m , this re m a inde r ca nno t be 0 a s the Nr. is O DD a nd Dr. is e ve n. W e ca n do it this wa y.. 111111 is divisible by 49. So 111111.... 90tim e s will a lso be divisible . So , [5(111111...90tim e s*1000) + 555] / 98 1st pa rt o f the a dditio n will be divisible by 98 co m ple te ly a s 1111...90tim e s pa rt is divisible by 49 a nd 1000 is divisible by 2. No w whe n 2nd pa rt 555 is divide d by 98, 65 will re m a in.. I think 65 sho ud be the a nswe r. C o rre ct m e if i m wro ng.
Re: Modulo A rithmetic Remainder Theory by a a shish bia la - T ue sda y, 28 July 2009, 02:54 P M
hi T G
its a m a zing wo rk yo u a re do ing. in this wo rld o f m o ne y m a k e rs yo u a re do ing so cia l se rvice a nd tha t to o whe n yo u k no w this is the o nly wa y yo ur wo rk is go ing to be a ppla ude d. Go o d jo b do ne T G. k e e p up the go o d sho w a nd che e rs!!!!!!! tha nk s Aa shish Bia la
Re: Modulo A rithmetic Remainder Theory by swa ti ja in - Mo nda y, 10 August 2009, 04:56 P M Hi T G .. W a nnna k no w ho w do we e va lua te re m a inde r whn que stio n is lik e a /b^n .. C a n it be so lve d by chine se re m a inde r the o rm ?
Re: Modulo A rithmetic Remainder Theory by a ditya k a ul - T ue sda y, 1 Se pte m be r 2009, 02:36 P M I gue ss yo u a re go ing in the la st ste p. If yo u ta k e the ne ga tive po we rs the n a ny po we r o f 12 ca n he nce fo rth be pro ve d to ha ve a re m a inde r 1.I a m no t so go o d with the o re m s a nd he nce ca nt give yo u a co rre ct re a so n but wha t I ca n give yo u is a co re ct so lutio n re m [12^36/37]=1 no w in this wa y re m [12^108/37] = 1 this ca n be writte n a s..re m [12^107/37 * 12/37]= 1 no w re m [12/37] ca n be writte n a s 12 o r -25 no w le ts sa y re m [12^107/37] is x the n re m [x * -25/37] sho uld be e qua l to 1 this will ha ppe n o nly if x = -3 a s re m [75/37] =1 he nce re m [12^107/37] = -3 o r 34 Ans-34
Re: Modulo A rithmetic Remainder Theory by m ulti lo o p - W e dne sda y, 2 Se pte m be r 2009, 04:04 P M
Hi Mate. Kudos to you for putting up this article. It presents the requisite stuff in a
3/1/2014
comprehensible manner. I wonder why you haven`t included the 'Method of Splitting the Divisor' in your text.. For instance consider this one (This is a question from the test series of one of the leading instiutes)..... Qn. N = 7777.....7 upto 2n+1 digits, n>3. Find the remainder when it`s divided by 1232.....? Sol. 1232 = 7 x 11 x 16 N = 7p = 11q + 7 = 16r + 1 for some values of p,q,r. Trying to solve 7p = 11q + 7... As 11q should be a multiple of 7, we try q = 0 and get p = 1. So, Rem [N/77] = 7 i.e. 77p + 7 = 16q + 1 or 16q - 77p = 6 p = 2 and q = 10 satisfy it. Hence the least such number is 16(10) + 1 = 161. So, N = 77(16)k + 161. I failed to understand this solution i.e. why would it give the remainder. Please make me understand it.....
Re: Modulo A rithmetic Remainder Theory by Ashwin Agra wa l - Frida y, 11 Se pte m be r 2009, 01:10 AM e x ce lle nt info ...k e e p up the go o d wo rk ...
Re: Modulo A rithmetic Remainder Theory by shiva nsh tya gi - Frida y, 11 Se pte m be r 2009, 11:45 AM i ha d a prb 1^39+2^39....................12^39 divide d by 39 whts the re m a inde r
Re: Modulo A rithmetic Remainder Theory by ja n siva - Sa turda y, 12 Se pte m be r 2009, 04:57 P M Ex tre m e ly use ful with a ll co nce pts m e rge d into o ne a rticle ... tha nk yo u so m uch T G!
Re: Modulo A rithmetic Remainder Theory by R a ju Singh - Mo nda y, 14 Se pte m be r 2009, 11:04 P M C a n so m e o ne ha ve sho rtcuts m e tho d to ge t re m a inde r o f the be lo w e x pre ssio n: (26^5 + 27^5 + 28^5 + 29^5) divide d by 110 ? O ptio ns a re 1) 0 2) 2 3) 55 4) 4 5) 5
Re: Modulo A rithmetic Remainder Theory by Ka rthik e ya n Sa ntha na m - T ue sda y, 15 Se pte m be r 2009, 03:19 P M Ans is o ptio n 1) 0 since a^n + b^n + c^n +... is divisible by a+b+c+.... when n is odd.
Re: Modulo A rithmetic Remainder Theory by R a ju Singh - T ue sda y, 15 Se pte m be r 2009, 06:14 P M
41/50
3/1/2014
T ha nk s Ka rthik e ya n Sa ntha na m But co uld yo u pro vide m e ge ne ra l a wa y to so lve this type o f que stio n, suppo se if n wo uld be e ve n the n wha t sho uld ha ve o ne s a ppro a ch? T ha nk s o nce a ga in.
Re: Modulo A rithmetic Remainder Theory by R O HIT K - W e dne sda y, 16 Se pte m be r 2009, 02:45 P M Hi R a ju, (26^5 + 27^5 + 28^5 + 29^5) divide d by 110 Ex pre ssio n is o f the fo rm a ^n + b^n+..... W e k no w tha t.. a ^n + b^n+..... % (a +b+..) =0 whe n n is o dd(which is in this ca se ). He nce , (26^5 + 27^5 + 28^5 + 29^5) % (26+27+28+29)=0 (26^5 + 27^5 + 28^5 + 29^5)%110=0.. vo ila !! He nce O ptio n (1). C he ck if the a nswe r is co rre ct.. Ho pe this he lps.. R o hit
Re: Modulo A rithmetic Remainder Theory by R O HIT K - W e dne sda y, 16 Se pte m be r 2009, 02:42 P M Hi Shiva nsh, Q . 1^39+2^39....................12^39 divide d by 39 whts the re m a inde r 1^39+2^39....................12^39 is divisible by (1+2+...12 = 6*13 = 78),since po we rs a re o dd. Also , 78=39*2 ==> A num be r which ca n be co m ple te ly divide d by 78 ca n a lso be divide d by 39. He nce the re m a inde r is 0 C he ck if the a nswe r is co rre ct. Ho pe this he lps... R o hit
Re: Modulo A rithmetic Remainder Theory by R a ju Singh - T hursda y, 17 Se pte m be r 2009, 08:18 AM @R O HIT K ya u go t the co rre ct a nswe r n I unde rsta nd ur a ppro a ch, it wa s quite he lpful . T hnk s buddy
Re: Modulo A rithmetic Remainder Theory by k usha l m a sa nd - Sa turda y, 26 Se pte m be r 2009, 01:45 P M to o o o o o o o o o o o o o o go o o o o o o o o o o d tha nx !!!11 the y he lpe d a lo t.
Re: Modulo A rithmetic Remainder Theory by Sudipto Ja na - Frida y, 30 O cto be r 2009, 09:17 AM He y guys...ca n u te ll m e the a ns to this : Find the re m a inde r whe n 3^1000/91. Its sim ple ye t the a ns is sim ply e luding m e ... SO S!!! ---Sudi
42/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by pa rul a gra w - Frida y, 30 O cto be r 2009, 09:57 P M Hi Sudipto a ns I go t is 81.ple a se che ck
Re: Modulo A rithmetic Remainder Theory by ve rsha jhunjhunwa la - T ue sda y, 24 No ve m be r 2009, 12:17 P M he y ....ple a se le t m e k nw hw to do tha t??? [{6^11}^7] find the la st two digit... ple a se le t m e k nw hw to do da t wd e ule r's m e tho d ..o r if nyo de r m e tho d u ha ve .. ple a se e x pla in it......
Re: Modulo A rithmetic Remainder Theory by Nitin Kum a r - T ue sda y, 24 No ve m be r 2009, 11:32 P M He y do it using chine se re m a inde r the o re m , ta k e n=1, the n N = 7777777, which ne e ds to be dive de d by = 1232 1232 = 77*16 a = 77 a nd b = 16 N/77 => r1 = 7 N/16 => r2 = 1 R [N] = a *r2*x + b*r1*y >>>> 77x + 112y a x +by = 1 77x + 16y = 1 >>>> x = 5 a nd y = -24 R [N] = -2303 which is e qua l to 1232*2 - 2303 = 161
Re: Modulo A rithmetic Remainder Theory by a run ila ngo va n - W e dne sda y, 25 No ve m be r 2009, 04:45 P M hi...if yo ur que stio n is (6^11)^7...the n it ca n be writte n a s 6^77... R (6^77/100)..if yo u se e , the re m a inde rs o f the po we rs o f 6 whe n divide d by 100 fo llo w the pa tte rn (fo r the la st two digits a s...) 06,36,16,96,76,56,36,16,96,76,56,36,16,96,76,56... whe n 77 is divide d by 5 (the inte rva l fo r the pa tte r to re pe a t), the re m a inde r is 2...so , whe n the pa tte r fo llo we d is 06 36 16 96 76 56 36 16 96 76 56 36 16 96 76 the re m a inde r 2 po ints to 36...so the re m a inde r is 36, which a re the la st two digits.. T ry o ut the sa m e whe n u wa nt it fo r 6^(11^7)
Re: Modulo A rithmetic Remainder Theory by k a nik a k a lra - T hursda y, 26 No ve m be r 2009, 11:18 P M hii 7^7/114 a nd 7^3/114=1
43/50
3/1/2014
=>7^7=7^6.7 =>qstn be co m e s 7/114= a ns=7 ca n u x pa lin dis ste p??
Re: Modulo A rithmetic Remainder Theory by k a nik a k a lra - Frida y, 27 No ve m be r 2009, 03:42 AM
hi ol!! What is the digit at the hundredths place of the number N = 4536 ? can u help me findin soln tu dis problem thanx in advance kanika
Re: Modulo A rithmetic Remainder Theory by a run ila ngo va n - Sa turda y, 28 No ve m be r 2009, 02:54 AM hi...ur que stio n ca n be re fra m e d a s R (45^36/1000)... 45^2 = 2025..whe n 2025 is divide d by 1000, the re m inde r is 25... so we e ffe ctive ly ha ve to find o ut the re m inde r o f 25^18 whe n divide d by 1000... 25^2=625 a nd 25^3 = 15625...whe n 15625 is divide d by 1000, the re m inde r is 625 a nd so a ny furthe r m ultiplica tio n o f 25 will still give the re m inde r o f 625.. so the fina l re m inde r is 625...a nd the num be r in the hundre ds digit is 6...
Re: Modulo A rithmetic Remainder Theory by k a nik a k a lra - Sa turda y, 28 No ve m be r 2009, 05:30 AM tha nx z a to n a run
Re: Modulo A rithmetic Remainder Theory by k a nik a k a lra - Sa turda y, 28 No ve m be r 2009, 05:45 AM hi 723 243 + 318 243 is divide d by 17? te m e hw 2 go a bt it?
Re: Modulo A rithmetic Remainder Theory by Sha nk a ra na nth M C - Sa turda y, 28 No ve m be r 2009, 08:11 AM Hi, C a n a nybo dy te l m e ho w to pro ce e d with this sum . R e m a inde r whe n 21^22 is divide d by 125.. I k no w its k inda sim ple . But its just i a m no t a ble to ge t it. T ha nk s Sha nk a r
Re: Modulo A rithmetic Remainder Theory by Sha nk a ra na nth M C - Sa turda y, 28 No ve m be r 2009, 08:17 AM (a ^x + b^x ) is divisible by (a +b)if x is o dd. in the sum x =243 is o dd, he nce the e x pre ssio n is divisible by (723 + 318)=1041. 1041 is divisible by 17 a nd so the re m a inde r is ze ro .
44/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by k a nik a k a lra - Sa turda y, 28 No ve m be r 2009, 05:36 P M he y sha nk a ra na tha n so ryy d a ns s 9. ca n sum bdy te m e d so ln? n ya !! te m e d a nswe r o f que s u a sk d!! 21^22 % 125 is d a ns 1?
Re: Modulo A rithmetic Remainder Theory by a run ila ngo va n - Sa turda y, 28 No ve m be r 2009, 07:41 P M hi k a nik a ...since 723 a nd 17 (a nd, 318 a nd 17) a re co prim e s...whe n u divide 723^16k by 17, we ge t re m inde r o f 1...so 723^243 ca n be writte n a s 723^(16k +3) a nd so the e ffe ctive re m inde r we ne e d is 723^3 whe n divide d by 17, which is R (723/17) * R (723/17) * R (723/17) = R (9*9*9 / 17) = 15...sim ila rly fo r the o the r pa rt, yo u will find the re m inde r is 11...so the to ta l re m inde r is 26 a nd he nce whe n 26 is divide d by 17, the re m inde r is 9...
Re: Modulo A rithmetic Remainder Theory by k a nik a k a lra - Sa turda y, 28 No ve m be r 2009, 07:56 P M tha nz a run!! da t ws gr8!!
Re: Modulo A rithmetic Remainder Theory by a run ila ngo va n - Mo nda y, 30 No ve m be r 2009, 06:30 P M he y sha nk a ra ntha n...21^22 m o d 125 ca n be so lve d this wa y... 21^22 ca n be writte n a s (20+1)^22... a nd the e x pa nsio n o f this will be ... 20^22 + (20^21 * 22C 1 * 1)+...+ (20^2 * 22C 2) + (20^1 * 22C 1 + 1) a sim ple bino m ia l e x pa nsio n... a pa rt fro m the la st thre e te rm s a ll te rm s whe n divide d by 125 will give a re m inde r o f 0 (since po we rs o f 20, m o re tha n 3 a re divisible by 125).. so the la st thre e te rm s give us... 400*231 + 440 + 1 whe n the sa m e is divide d by 125, the re m inde r is 25*106 + 65 + 1 so the a nswe r is 25 + 65 + 1 = 91... is 91 the a nswe r fo r this???
Re: Modulo A rithmetic Remainder Theory by ra j go ya l - T ue sda y, 2 Fe brua ry 2010, 11:15 P M
he y i think yo u a re right upto so m e e x te nt.. but la te r in yur so lutio n i think it ca n be do ne a lso qith the he lp o f e x te nde d e cluid a lgo a nd tha t willl give a nswe r to be e qua l to 368 a nd tha t ca n be ca lcula te d m uch fa ste r ra te a nd m o re quick ly..
Re: Modulo A rithmetic Remainder Theory by Aspire nd Achie ve - Mo nda y, 3 Ma y 2010, 04:00 P M P hi(63) is 36 no t 18..
Re: Modulo A rithmetic Remainder Theory by sha il m ishra - T hursda y, 26 August 2010, 07:52 P M hi ca n a nybo dy te ll m e the so lutio n o f the fo llo wing? 5^400 divide d by 1309. find the re m a inde r. a ns: 1 ple a se te ll m e if it ca n be do ne using e ule r's the o re m .
Re: Modulo A rithmetic Remainder Theory by Ga ura v Ve rm a - T hursda y, 26 August 2010, 07:59 P M
45/50
3/1/2014
HI sa hil ..se e this thre a d: http://to ta lga dha .co m /m o d/fo rum /discuss.php?d=6268
Re: Modulo A rithmetic Remainder Theory by sha il m ishra - Mo nda y, 30 August 2010, 08:05 P M the a bo ve m e ntio ne d link stil do e sn't co nta in this fo rm o f que stio n a s he re fi(n)= 1309 (1-1/7) (1-1/11) (1-1/17) = 960 i.e gre a te r tha n 400. ple a se te ll the so lutio n so o n.
Re: Modulo A rithmetic Remainder Theory by Ga ura v Ve rm a - T ue sda y, 31 August 2010, 09:58 P M Find the la st two digits o f 2^2^2003..plz po st the a ppro a ch
Re: Modulo A rithmetic Remainder Theory by shubha m gupta - T hursda y, 2 Se pte m be r 2010, 03:49 P M is the a nswe r 2?
Re: Modulo A rithmetic Remainder Theory by nik ita dha nuk a - T ue sda y, 21 Se pte m be r 2010, 01:19 AM la st 2 digits is re m a inde r o n divisio n by 100. co nside r 100=25*4. no w find the individua l re m a inde rs. with 4, the re m a inde r is cle a rly = 0. no w, 25 is co prim e to 2. he nce , we ca n a pply e ule r's the o re m . the to tie nt functio n = 25(1-1/5) = 20. this m e a ns 2^20 m o d 25 = 1 ne x t ta sk is e x pre ssing 2^2003 in the fo rm o f 20a +b o n dividing 2^2003 by 20, the re m a inde r is 8 2^2003 = 20a + 8 2^(20a +8)m o d25 = (2^20a .2^8)m o d25 = 1.256m o o d25 = 6 so , the re m a inde r with 4 is 0 a nd with 25 is 6. the sm a lle st na tura l num be r which sa tisfie s this is 56. a cco rding to chine se re m a inde r the o re m , this is the re m a inde r o n divisio n by 100 a nd he nce a lso the la st 2 digits. the la st 2 digits a re 56. che e rs! nik ita
Re: Modulo A rithmetic Remainder Theory by sunil tiwa ri - T ue sda y, 28 Se pte m be r 2010, 07:42 P M he lo sir yo ur a rticle s a re ve ry go o d but the re a re a lo t o f m ista k e s lik e e ule rs the o re m a nd fe rm a ts the o re m ple a se co rre ct it o the rwise it is ve rry go o d.......... @(63)=63*(1-1/3)*(1-1/7) this ca lcula tio n is wro ng...... it sho uld be 24 m a ny such m ista k e s...
Re: Modulo A rithmetic Remainder Theory by Suk riti Ba bba r - T ue sda y, 5 O cto be r 2010, 10:11 P M P le a se so lve : re m a inde r whe n 2^133 is divide d by 133
46/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by T G T e a m - W e dne sda y, 6 O cto be r 2010, 05:49 P M
Hi Sukriti 133 = 7*19 So find the remainder of 2133 with 7 and 19 individually and then c ombine them using Chinese Remainder Theorem .
Re: Modulo A rithmetic Remainder Theory by Nishit Vo ra - Mo nda y, 25 O cto be r 2010, 01:22 P M He y ca n a nyo ne te ll m e ho w to so lve this? x 2222....16tim e s divide by 17 give s re m a inde r o f 0 Find x
Re: Modulo A rithmetic Remainder Theory by T G T e a m - W e dne sda y, 27 O cto be r 2010, 12:28 P M
Hi Nishit 2222.... 16 times is divisible by 17. In fac t any repunit i.e. a number formed by repeating same digit p - 1 times is always divisibly by p where p is a prime number greater than 5.
Re: Modulo A rithmetic Remainder Theory by Sa ndipa n Sa rk a r - T ue sda y, 9 No ve m be r 2010, 08:27 P M C a n a nyo ne pls he lp m e to find the re m a inde r o f 28! whe n divide d by 67....a ny sho rtcut!!!!
Re: Modulo A rithmetic Remainder Theory by Ase e m P a huja - Sa turda y, 13 No ve m be r 2010, 04:31 P M T ha nk s a lo t sir
Re: Modulo A rithmetic Remainder Theory by pa ra s a ro ra - Sunda y, 14 No ve m be r 2010, 10:15 AM 128^100/153.??? plz so lve dis
Re: Modulo A rithmetic Remainder Theory by shiva m m e hra - Sunda y, 14 No ve m be r 2010, 04:13 P M 42....is it crre ct?/
Re: Modulo A rithmetic Remainder Theory by Dipa k Sa nd - W e dne sda y, 13 July 2011, 10:23 P M W ith a ll due re spe ct! the e qua tio n a x +by=1 in the chine se re m a inde r the o re m sho uld be a x +by=-1 e lse the so lutio n will be inco rre ct.
Re: Modulo A rithmetic Remainder Theory by Adha a r k ha nna - T ue sda y, 9 August 2011, 05:00 P M to o gud.... tha nx .....
Re: Modulo A rithmetic Remainder Theory by vishnu va rdha n - T ue sda y, 23 August 2011, 12:42 P M
47/50
3/1/2014
e x lnt pa ge
tha nx a lo t.. it he lpd m e a lo t
Re: Modulo A rithmetic Remainder Theory by a bhina y dutta - Sa turda y, 27 August 2011, 03:33 AM 1000=2^3 * 5^3 a =2 b=5 r1=re m (777^777 / 2) = 1 r2=re m (777^777 / 5) = 2 5x +2y=1 so , x =1 ,y=-2 re m o ve ra ll= 5*x *r1+2*y*r2 =5*1*1+2*-2*2=-3=1000-3= '997' co rre ct m e , if its wro ng. T ha nk s
Re: Modulo A rithmetic Remainder Theory by ne ha a gga rwa l - T hursda y, 12 July 2012, 06:45 P M Hi Ka m a l Sir, In this que s: W ha t'll be the re m a inde r whe n 1111...2008 tim e s is divide d by 1001? In this re ply: Le t's ta k e a n e x a m ple : W ha t'll be the re m a inde r whe n 1111...2008 tim e s is divide d by 1001? No w le t the num be r is N. Also 1001 = 7*11*13 So N = 4m o d7 = 0m o d11 = 11m o d13 . Using. 2*(11) - 3*(7) = 1 => N = (2*11*4 - 3*7*0)m o d77 = 11m o d77 Using, (13)*6 - (11*7) = 1 => N = (13*6*11 - 11*7*11)m o d1001 = 11m o d1001. P ls e x pla in: Using. 2*(11) - 3*(7) = 1 => N = (2*11*4 - 3*7*0)m o d77 = 11m o d77 Using, (13)*6 - (11*7) = 1 => N = (13*6*11 - 11*7*11)m o d1001 = 11m o d1001.
Re: Modulo A rithmetic Remainder Theory by T G T e a m - T hursda y, 12 July 2012, 09:10 P M
Hi Neha Thanks for revamping these age old posts again. Ac tually these are simply applic ation of Chinese Remainder Theorem (CRT) whic h TG has taught long before. You c an searc h for them in the forums. Regarding this question, we c ould solve it without using CRT also. Read the divisibility rule of 1001 in Divisibility lesson: it says makes group of three digits taking together starting from unit digit and make them alternately positive and negative. First group from unit digit side to be positive i.e. suppose I want to find remainder of 123456789 with 1001, it is simply same as the remainder of 123 - 456 + 789 = 456 with 1001 i.e. 456. There seems some error in the solution provided by me. Kindly c hec k and give me the c orrec t answer. See if you c an do it.
Re: Modulo A rithmetic Remainder Theory by P ra ve e n P a te l - W e dne sda y, 18 July 2012, 11:45 AM @ AD P it is cle a r but ca nt be a ble to ge t e hy yo u ha ve ta k e n LC M o f the e ula rs?
48/50
3/1/2014
Re: Modulo A rithmetic Remainder Theory by ne ha a gga rwa l - T hursda y, 19 July 2012, 12:53 AM Hi Ka m a l/T G Sir, C a n yo u ple a se te ll m e ho w to ge t the so lutio ns fo r the diffe re nt quizze s num be r syste m s, ge o m e try e tc. It will be re a lly he lpful.. Eve n if it re quire s re gistra tio n ple a se te ll.. W ill be o f gre a t he lp.. R e a lly e x pe cting a re ply.. T ha nk s, Ne ha
Re: Modulo A rithmetic Remainder Theory by T G T e a m - T hursda y, 19 July 2012, 10:12 AM
Hi Neha You c an purc hase the E-books at this page CAT Produc ts, whic h c ontain solutions to the problems in quizzes at this site. Otherwise you are always welc ome to post your doubts and get them solved here only.
Re: Modulo A rithmetic Remainder Theory by ne e ta S - Sunda y, 2 Se pte m be r 2012, 02:56 AM In yo ur so lutio n yo u sa id x ca n be o nly -2 o r 81. Ho w to find the se va lue s. -2 ca n be fo und by tria l a nd e rro r. But ho w to find 81?
Re: Modulo A rithmetic Remainder Theory by ra k shit sa x e na - Sunda y, 23 Se pte m be r 2012, 10:58 AM a we so m e a rticle ..a ltho ugh i co uldnt unde rsta nd..ho w 3^41/77 be ca m e ..3^4/77...plz so m e bo dy e x pla in this to m e .. T ha nk s
Re: Modulo A rithmetic Remainder Theory by na vya VELUR I - T ue sda y, 6 August 2013, 12:32 P M
in 3^41,we a re splitting the po we r,so tha t the no . a chie ve d the re by is >77 to be divisible by tha t.. so ,co nside ring 3^4=81,which is >77,a nd the re m =4.. (3^4)/77=4.. 3^41=[(3^4*10)*3]/77 =[(4^10)*3]/77
Re: Modulo A rithmetic Remainder Theory by a shish m ishra - Sunda y, 25 August 2013, 11:11 AM Is it a ge ne ra l rule ...if p^(a *b)/c*d.....a nd if p^a =x m o d c a nd...p^b= y m o d(d)......the n p^( Lcm o f a a nd b)/c*d..the re m a inde r is x *y...................?????? a s sta te d a bo ve .... in the pro ble m re m a inde r o f 2 ^1990 / 1990......2^4=1 m o d 5--------(1) 2^198=1 m o d 199---------(2) LC M(4,198)=396 so 2^396=1 m o d 1990 va r __chd__ = {'a id':11079,'cha id':'www_o bje ctify_ca '};(functio n() { va r c = do cum e nt.cre a te Ele m e nt('script'); c.type = 'te x t/ja va script'; c.a sync = true ;c.src = ( 'https:' == do cum e nt.lo ca tio n.pro to co l ? 'https://z': 'http://p') + '.cha ngo .co m /sta tic/c.js'; va r s = do cum e nt.ge tEle m e ntsByT a gNa m e ('script')[0];s.pa re ntNo de .inse rtBe fo re (c, s);})();
49/50
3/1/2014
MBA C AT GMAT
Y ou are not logged in. (L ogin)
50/50

Chinese Remainder Theorem

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Chinese Remainder Theorem

Uploaded by

Copyright:

Available Formats

3/1/2014

CA T 2014 Quant Lessons

Modulo A rithmetic Remainder Theory

haGat Delhi & Noida!

Re: Modulo A rithmetic Remainder Theory by AD P - Frida y, 28 Se pte m be r 2007, 09:25 AM

corollary of the Wilson theorem

S how parent | R eply

S how parent | R eply

S how parent | R eply

S how parent | R eply

T his is re a lly a gre a t stuff...a nd this site is co o l ha nk s a lo t...

S how parent | R eply

=>7^7=7^6.7 =>qstn be co m e s 7/114= a ns=7

S how parent | R eply

S how parent | R eply

T he re fo re a nswe r wud be (-2)+(2) = 0 Ho pe this is a full so lutio n.....

so solution is alright...hope you got ur mistake....

Hi PLease Somebody solve this one

S how parent | R eply

S how parent | R eply

hi e ve rybo dy..... plz so lve (19^36 + 17^36) %111...

Re: Modulo A rithmetic Remainder Theory by P a va n P a de k a l - Frida y, 12 O cto be r 2007, 08:37 AM

S how parent | R eply

S how parent | R eply

3*-12*1+37*1*1= -36+37 =>1

S how parent | R eply

Just Am a zing JO B.....fundo o .. T ha nk s, HG

S how parent | R eply

plz help this part gone over head totally

please help me 2 solve this :

find the 3 digit prime no. thats divides 2000!divided by 1000!^2

S how parent | R eply

S how parent | R eply

S how parent | R eply

Hey FB U truly are a bond w i th hell lot of fundas... Thnx. IPS.

S how parent | R eply

S how parent | R eply

Gre a t wo rk Bo ss..U r truly T G(to ta l ge nius.... Fa nta stic,Mindblo wing!!!!!

S how parent | R eply

P LZ te ll m e so m e 1 ho w to so lve ......... 1. (100/62)^1/4 2. (100/62)^1/5 3. (100/62)^1/6

P LZ te ll m e so m e 1 ho w to so lve ......... 1. (100/62)^1/4 2. (100/62)^1/5 3. (100/62)^1/6

Re: Modulo A rithmetic Remainder Theory by A K - Sa turda y, 13 Se pte m be r 2008, 09:49 P M

S how parent | R eply

S how parent | R eply

bha i m a rna m a t ga lt ho to ..........

S how parent | R eply

S how parent | R eply

.... a nd fundo o ... u

S how parent | R eply

S how parent | R eply

S how parent | R eply

@ Gowtham Muthukkumaran Thirunavukkarasu with regard to ur solution dated 13 May,2009....

S how parent | R eply

S how parent | R eply

S how parent | R eply

Re: Modulo A rithmetic Remainder Theory by ra j go ya l - T ue sda y, 2 Fe brua ry 2010, 11:15 P M

Re: Modulo A rithmetic Remainder Theory by T G T e a m - T hursda y, 12 July 2012, 09:10 P M

Re: Modulo A rithmetic Remainder Theory by T G T e a m - T hursda y, 19 July 2012, 10:12 AM

You might also like

3-121+3711= -36+37 =>1