Remainder Theory

8/14/2015
MBA|CAT|CAT2013|CAT2014|CATOnline|MBA2013|MBA2014|MBAEntranceExams|CATTest|Preparation|CATQuestions
<
Jumpto...
Home Forums CAT2014QuantLessons ModuloArithmeticRemainderTheory
>
Searchforums
NewBatchesatTathaGatDelhi&Noida!
Displayrepliesflat,witholdestfirst
ModuloArithmeticRemainderTheory
byfundoobondFriday,28September2007,03:18AM
ThisextremelyusefularticleforfindingremaindershasbeencontributedtoTGbyFundooBond,anotherintelligent
TGite.AlltheCAT2007/2008whofindthisarticleusefularerequestedtosaythankstoFundooBondforhis
effortsandthiswonderfulcompilation.Ifyouhavesomeinterestingarticle,fundaorhelpfulinformationtoshare,
pleasemailittousandwewillpostitbyyournameTotalGadha
Theproblemsoffindingtheremainderareconsideredthemostdreadfulamongthenumbertheoryproblems.
Fortunately,ifwearmourselveswithsomebasictheorems,wewillseethatwecanturnthesemindboggling
problemsintosittersandcanensuresomeeasymarks.
Iwillbetryingtoshareboththetheoryandtheexamplesinordertomaketheconceptsclearer.Againfriends,dokeepinmindthatIamnot
ageniustowritethesetheoremsonmyown.IhavelearntthemfromvarioussourcesandIamtryingmybesttoexplainyouinmyown
words.
http://totalgadha.com/mod/forum/discuss.php?d=1369
1/51
8/14/2015
2/51
8/14/2015
3/51
8/14/2015
Reply
Re:ModuloArithmeticRemainderTheory
byRishiKapoorFriday,28September2007,05:06AM
ThanksSir...ThisiswhatIwassearchingfor...andyouhavegivenitinthebesttime...
YouarereallyTG.....TooooooooGooooood
withtheseFundootheorams,youhaveprovedyourselfBOND
Showparent|Reply
byMadyAhmedFriday,28September2007,05:36AM
wow,fabulous,fantastic,mindblowing,excellent...wordsareshortofmydictionarytopraiseuthanxalot
wink
Showparent|Reply
byshyamSundarFriday,28September2007,08:46AM
heyfolks
howtodo40!%83
Showparent|Reply
byADPFriday,28September2007,09:25AM
corollaryoftheWilsontheorem
whichwillbeveryusefulwhensolvingremainderproblems.
FromWilsontheorem,
wehave(p1)!%p=(p1)or1(1)
from(1)wecansay(p2)!%p=1
Showparent|Reply
HeyShyamSunder
Solutiontourproblem
40!mod83
WeknowthtfrmWilson'sTheorem
(p1)!%p=(p1)or1(iffpisprime)
so,wecandeduce
82!%83=1or82(1)
frmWilson'sCorollary
(p2)!%p=1
so,wecandeducehere
81!%83=1(2)
Now81!=81.80.79..42.41!(3)
from2and3
(81.80.79..42.41!)%83=1
2*3*4*5....41*41!=41!*41!%83=(41!)^2%83=1
whichispossibleonlywhen41!mod83=1
becausethereareevennooftermssonegativesigngotcancelled
Nowwehave41!mod83=1
(41.40!)%83=1
(42.40!)%83=1
suppose40!=x
(42*x)%83=1
whichispossibleonlywhenxbecomes2or81
soansis81
Showparent|Reply
4/51
8/14/2015
bysubhadeepdasFriday,28September2007,09:43AM
howtosolve
(i)findtheremainderof55555....93timesdividedby98
(ii)remainderof2^1990/1990
Showparent|Reply
howtosolve
1990=2.5.199
fromEuler'sTheorem
phi(2)=1
phi(5)=4
phi(199)=198
2^4=1mod5(1)
2^198=1mod199(2)
LCM(4,198)=396
so
2^396=1mod1990
2^1980=1mod1990(because1980isamultipleof396)
sonowweremainwith
2^10mod1990
1024mod1990=1024
ansis1024
Showparent|Reply
bylavikaguptaFriday,28September2007,09:51AM
hiMr.FundooBond.
thisisamasterpiece2learntheconceptsofremaindertheorem.ifoundthechineseremaindertheoremabitmoreabstruse2master,yetother
theoremsandtheirenunciationwithexamplesprovedreallyhelpful2me.hope2seesuchgreatworkagainfromu.
HATSOFFTOU
Showparent|Reply
byCatapult!!!OnthewayFriday,28September2007,09:58AM
HiFundooBond!!!
Justoneword..
"Superb"..
biggrin
Showparent|Reply
98=2.7.7
Itisclearthatthegivennogivesremainderof11.....1193times
whendividedby2
sonowquestionremains
(5555....5593times)mod49
55555.......5593times
=5x10^92+5x10^51++5
=5[10^0+10^1++10^92]
=5[(10^931)/9]
=5[(11111111111111....1192times)]
Ithinkansis5
plzzcheckitout
Showparent|Reply
byjitendrahavaldarFriday,28September2007,10:23AM
HiTG,
reallyanunbelievablearticletosaytheleast....
Continueyourgoodwork...
Thanks,
5/51
8/14/2015
Jitendra
Showparent|Reply
byTomGoelFriday,28September2007,10:36AM
hifundoo,
Thoughweallknowyouareafundooandabond.....bysharingthisarticletohaveshownaltruisticcharacter.Hatsofftoyou.
Thanks
Amit
Showparent|Reply
bySanjuPFriday,28September2007,11:03AM
HiFundoo,
Wonderfularticleandgreatcompilation!
Thanks!
SP
Showparent|Reply
bySoftwareEngineerFriday,28September2007,11:18AM
FB
MarvelousMethods!!!
Thanks,
SE
Showparent|Reply
bypurvivermaFriday,28September2007,12:18PM
fabulousistheword.....pleasepostsomemorefundasrelatedtonumbers.
Showparent|Reply
byankitharishFriday,28September2007,12:32PM
AwesomeCompilation.Thanksalotbond
Showparent|Reply
byfundoobondFriday,28September2007,12:40PM
HiTGnallTGites,
Thanksalotforalltheappericiation....Feelinggreatthatmyeffortsareappericiated...Anditgivesagrtjoythatthearticlewaspublishedexactlyas
itwassubmitted
...
regards,
fundoo
Showparent|Reply
byDagnyTaggartFriday,28September2007,01:20PM
KudosFundoo
Showparent|Reply
byTotalGadhaFriday,28September2007,01:55PM
6/51
8/14/2015
Showparent|Reply
bySSVVFriday,28September2007,03:01PM
i'msureuwontbelieveit...butwasjustgoingtopostarequesttoyouaskingyoutoexplaintheseverysametheorems....hadseentheminoneof
yourpostwhereintgmentionedtheseareyourfavouritetopics:>
secondlywantedtothankyouforallyourpreviousposts...ureallytookgrtpainsinexplaingallyourmethodsindetail(remembertheoneinwhichi
askedfordigitalrootandyoutypedupthedetailedapproach)andnowthis....whtcanisaybut'rockondude'
cheers!!
Showparent|Reply
byimrankhanFriday,28September2007,03:58PM
uguyzarejusfantabulous.............thanxaton......godblessurspecies............
Showparent|Reply
byManishKashyapFriday,28September2007,04:51PM
HiFundoo,
Itsreallysuperb.OnlyonethingIcansay"Fundoo".
ThanksandRegards,
Manish
Showparent|Reply
byShubhagataroyFriday,28September2007,07:00PM
bindassss............
remof
7^115dividedby114??
Showparent|Reply
byAbhraChatterjeeFriday,28September2007,07:25PM
WonderfuljobBond
.....PleasepostsomethingonPermutationandProbability.
Showparent|Reply
byAviatorDFriday,28September2007,07:29PM
hifb,
First,thankyouforthepost.Itisveryhelpful.
Intheques.:howtosolve
1990=2.5.199
fromEuler'sTheorem
phi(2)=1
phi(5)=4
phi(199)=198
2^4=1mod5(1)
2^198=1mod199(2)
LCM(4,198)=396
so
2^396=1mod1990
sonowweremainwith
2^10mod1990
1024mod1990=1024
ansis1024
7/51
8/14/2015
howcanweapplyuler'stheoreminthiscase?becauseaccordingtourpostwecanonlyusethetheoremwhen
bothM(=2)andN(=1990)arecoprimes,butthisnotthecasehere.
Kindlyelaborate.
Showparent|Reply
byDeepAgrawalFriday,28September2007,07:55PM
7^115/114.
Phi(114)=66
hence7^66/114=1
Remainingis7^49/114
=>((7^3)^16*7)/114=1^16*7/114=7(Since,7^3=343=>343/114=1)
Showparent|Reply
byrohitavasthiFriday,28September2007,08:30PM
hey,
thnxforthisarticle...ihavbeenlukinforthetotientstyleofsolvingmethodsincelastfewmonths
theothermethodswereasfascinating...
......itwasextremelyhelpful...
thnx
rohit
Showparent|Reply
byrohitavasthiFriday,28September2007,08:18PM
hey,
thnxforthisarticle...ihavbeenlukinforthetotientstyleofsolvingmethodsincelastfewmonths......itwasextremelyhelpful...
thnx
rohit
Showparent|Reply
bysubhadeepdasFriday,28September2007,10:21PM
@ADP
yah,boththeanswersthatyougotareright,buti'mhavingtoughtimeunderstandingyoursolnfor2^1990/1990,speciallythepart
phi(2)=1
phi(5)=4
phi(199)=198
2^4=1mod5(1)
2^198=1mod199(2)
LCM(4,198)=396
pleaseelaboratealittlebitmore
Showparent|Reply
byADPFriday,28September2007,10:24PM
HiAviatorD
IfollowedtheEuler'sTheorem
Euler'sTheoremisthegeneralizationofFermat'sLittleTheorem,applicablewhenurdividendiscompositeinform.Sowefirstfindprimefactorsfor
thecompositeno.
Aftergettingprimefactors,useEuler'stotienttoobtainphi(x)values.phi(x)
justdefinenoofnowhicharecoprimetox&<x
Aftergettingtotientforeachprimefactor,applyFermat'slittleorEulerforeachprimefactor
Here1990iscomposite
jofirstconvertitintoprimes(orprimefactors)
8/51
8/14/2015
Showparent|Reply
byADPFriday,28September2007,10:33PM
HiShubhdeep
WatisEuler'sTheorem
EulersTheorem:
IFxisanypositiveintegerprimetoNthen
x^Phi(N)=1(modN)
N=a^p.b^q.c^r.(primefactors)
Phi(N)=N(11/a)*(11/b)*(11/c)andisknownasEulersTotientFunction
Phi(N)definesnoofnumberswhicharelessthenNandcoprimetoN
IfNintheaboveEulersTheoremisprime,thenPhi(N)=N(11/N)=
(N1)
SoifNisprimeandxiscoprimetoN,thentheEulersTheorembecomesFermatsTheorem
Asx^(N1)=1(modN)
Sointhisquestion
wefirstbreak1990intoprimefactorsbecauseforEulerconditionisthatx&Nareprimetoeachotheri.ecoprimes
1990=2.5.199
andseparatelyapplyEuler
hopesoitsclearnow
Showparent|Reply
byindiraghoshFriday,28September2007,11:30PM
thanks.i'llpractice&tryallthismethod.Itwasgreat.butihaveproblemsingeometrysowhatiwilldo?
Showparent|Reply
byAviatorDSaturday,29September2007,07:56AM
@ADPThanksforthepromptresponse.
HiAviatorD
IfollowedtheEuler'sTheorem
Euler'sTheoremisthegeneralizationofFermat'sLittleTheorem,applicablewhenurdividendiscompositeinform.Sowefirstfindprimefactorsfor
thecompositeno.
Aftergettingprimefactors,useEuler'stotienttoobtainphi(x)values.phi(x)
justdefinenoofnowhicharecoprimetox&<x
Aftergettingtotientforeachprimefactor,applyFermat'slittleorEulerforeachprimefactor
Here1990iscomposite
jofirstconvertitintoprimes(orprimefactors)
HiADP,
Referingtoyourpost,iunderstandthatwecanuseEuler'stheoremwhenthedividend(N,here)isacompositeno.,butadditonallyisitnotrequired
thatweensurethatdivisor(M,here)isrelativelycoprimetoN?
findingoutthetotientforeachprimefactorof1990(i.e.2*5*199)wouldgiveustheremainderswhen2^1990isdividedbyeachof2^1,5^4and
199^198,howdowethenusetheseremaindersobtainedtogetthefinalremainderwhen2^1990isdividedby1990?
Showparent|Reply
byADPSaturday,29September2007,08:08AM
@Aviatore
justtaketheLCMofpowers
Suppose
1990=2.5.199
phi(2)=1
phi(5)=4
phi(199)=198
9/51
8/14/2015
because2^phi(n)=1modn
2^phi(5)=2^4=1mod5
2^phi(199)=2^198=1mod199
takeLCMofpowersi.e.4&198here
LCM(4,199)=396
sowecansay
2^396=1mod1990simple
hopeuunderstand
Showparent|Reply
bymonhaldiSaturday,29September2007,11:11AM
remainderof5555......93timesdividedby98
5555555....93times
=5(111111....93times)
=5{11(10^91+10^89+...+10^3+10^1)+1}
=5{11*10(10^90+10^88+....+10^2+1)+1}......Eq(1)
now98canbewrittenas
=1002
or=10^22
useremaindertheoremmethodandput10^2=2inEq(1)
=5{110(2^45+2^44+...+1)+1}
=5{110(2^461)+1}.....Eq(2)
remainderof2^46whendividedby98is16(doownyourownbutbecareful
remainder2^10/98is44)
=5{110(161)+1}
=5(12*15+1)
=5(16+1)
=5(15)
=75
=23
soremainderis23
letmeknowifthisisthesolution
Showparent|Reply
byprafullkumarSaturday,29September2007,04:37PM
HiFundooooooooo,justwanttosay
ToooooooooooooooooooooooooooGoooooooooooooooooooooooooooooooooooooooooood
Showparent|Reply
byprabhjeetkaurSaturday,29September2007,06:10PM
helllooosir..
thankssforsuchaexcellentconceptbutsiricldntbeabletotakeouttheprintofthspage!!watshldidonow?
Showparent|Reply
byharshalmalaviyaSaturday,29September2007,11:18PM
Thankyou,sir,thearticleisamazing.iwassearchingfortheseconceptsfromalongtime...godblessuguys,uguysrdoinadamngudjob...some
fundasonalgebra,wouldbeofgreathelp,especiallyonhw.tosolveprob.ongraphsandsolvingprob.withthehelpofgraphs...thankinu.
harshal.
Showparent|Reply
byADPSaturday,29September2007,11:28PM
@monHaldi
ursolutioniscorrect
gudsolution
canuhelpmeinfollowingquestion
40!mdo83
Showparent|Reply
10/51
8/14/2015
byNaveenNaveenSunday,30September2007,12:34AM
Thisisreallyagreatstuff...andthissiteiscool
hanksalot...
Showparent|Reply
byvyombharadwajSunday,30September2007,11:51AM
reallyagrt..stuff...
wasactuallylookingforthisone...inacompiledformat...
and...AAAAHHH!!!hereitis..
thxfundoo..
biggrin
Showparent|Reply
bymonhaldiSunday,30September2007,06:52PM
hiADP
uveattemptallmostcorrect
for40!mod83until
41!^2mod83=1
41!mod83=1or1
thn41!^2mod83=1
theremustbesometheorem4it
ididntgottheansbtitllbe2or81
TGllhelptofindthecorrectsolution
WHATDOUSAYTGABTTHSPRBLM
postdsolutionifanyonehasit
Showparent|Reply
byparagkumarMonday,1October2007,02:06AM
whycan't41!%83be1?
Showparent|Reply
byADPMonday,1October2007,07:21AM
@monhaldi
Wilson'sTheorem
Showparent|Reply
bymonhaldiMonday,1October2007,11:53AM
idntmeantosaythat
41!mod83cantbe1
yesitcanbe1or1
nthusipredictedansiseither2or81
btwhichoneiscorrectidntknw
Showparent|Reply
byTotalgadhafanMonday,1October2007,01:12PM
2222222222gud
Showparent|Reply
11/51
8/14/2015
byparagkumarTuesday,2October2007,12:01AM
Ihaveabigdoubtonyourapproach.2^4mod5=1and2^198mod199=1doesn'tmeanthat2^396mod1990=1.Itcanevenbecheckedbythefact
that2^396and1990arebothevenandhencetheremaindershouldbeeven.Mysolutionislikethis
2^1990mod1990=2^1989/(199*5)
usingchineseremaindertheorum,
2^1989mod199(A)=114(r1)
2^1989mod5(B)=2(r2)
for199x+5y=1,x=1andy=40
henceremainder=199*2*1+114*5*40=22402
or,22402995*22=512
sincethenumeratoranddenominatorwerebothdividedby2hencetheactualremainderis512*2=1024.
Showparent|Reply
byTotalGadhaWednesday,3October2007,04:23AM
Remainderwhen40!isdividedby83:
Weknowthat82!+1isdivisibleby83.
82!=123....39404142...8182
>remainderby83=123....394042414039...321
=(40!) 24241>remainderwith83=R262.
NorR262+1isdivisibleby83>R262+1=83k>R2=(83k1)/62>k=3andR2=4>R=2=2or81.
Showparent|Reply
byRishiKapoorWednesday,3October2007,04:36AM
HeyTGpleaselookattheblogentriesandreplymyquerythatIhavepostedthere...
Showparent|Reply
bymonhaldiWednesday,3October2007,06:40AM
hiTG
btquestionremainsthesame
whatistheexactans
b/w2&81
Showparent|Reply
byNeophyte2CATWednesday,3October2007,03:25PM
niceexamplestocoveralltheconceptsthankyouverymuch
Showparent|Reply
byNitinSinghalWednesday,3October2007,04:59PM
HiTG,
yestedayiwasstrugglingwithaproblemwhichccomesunderremaindertheory.Pleaseexplainasitriedtosolveitwithabovegiventheoromsbut
resultedinaverycomplexsolution.Justtellmeifthisproblemcouldbesolvedinanysimplerway.Theproblemis
3^1001isdevidedby1001thenwhatistheremainder.
Manythanks,
Nitin
Showparent|Reply
byVarunChoudharyThursday,4October2007,01:23PM
12/51
8/14/2015
@Shubhagataroy
remof
7^115dividedby114??
7^3=343
7^115=7^(3*38+1)
=>7^115=(343^38)*7
So,theqstnisnow(343^38)*7/114.
Also,114*3=342.i.e1lessthan343
Thereforebyremaindertheoremitbecomes=(1^38)*7/114=7/114
=>Ansis7
Showparent|Reply
byfundoobondThursday,4October2007,03:05PM
hinitin,
1001isaprimeno.ifimntmistaking...soitseulerno.is1000.henceremllbe3?whtsdgivenans?
Showparent|Reply
byNitinSinghalThursday,4October2007,06:53PM
Nofundoobond
1001isnotaprimenumber.Itisdevisibleby7,11and13.
Theansweris947.
Showparent|Reply
byTotalGadhaThursday,4October2007,10:31PM
HiNitin,
1001=71113
Now,31001whendividedby7,11,and13givesremainders5,3and9,respectively.LetN=31001.
N=7a+5,N=11b+3,N=13c+9.Multiplyfirstequationby22,secondequationby21.
22N=154N+110
21N=231N+63,Subtractingweget,
N=4777k>78N=36661001M
Also,N=13c+9>77N=1001c+693
SubtractingN=29731001L=20021001L+971
Therefore,theremainderis971.
TotalGadha
Showparent|Reply
byAnkushJainFriday,5October2007,02:12AM
1001=77*13.
Ifweusechineseremaindertheoremalso,
a=77,b=13
r1=47,r2=9
x=1,y=6
Thereforeremainder=axr2+byr1=77*9+13*6*47=2973
Remainer(2973/1001)=971.
So,ithink971istheanswer
Showparent|Reply
byVarunChoudharyFriday,5October2007,01:31PM
@DeepAgrawalfor7^115/114.
13/51
8/14/2015
Phi(114)=36andnot66.....i.e.114(11/2)*(11/3)*(11/19)=36
thereforeweareleftwith7^7/114and7^3/114=1
=>7^7=7^6.7=>qstnbecomes7/114=ans=7
Showparent|Reply
byDeepAgrawalSaturday,6October2007,01:24AM
@Varun
Thanksforpointingitout.Amsorryforthemistake
Showparent|Reply
byAmaleshBandopadhyaySaturday,6October2007,01:58PM
Urreallyachamp..Thanksforthewonderfularticle...
Showparent|Reply
byAmeyaRaichSaturday,6October2007,10:27PM
Hellosir..
Couldyouplstellmehowtouseaboveidentitiesinsolvingsumslike:
remainderof:
1)77777777....(37digits)mod19?
2)123412341234...(89times)mod19?
isthereanythingelseweneedtoknowtosolvethese?
MyfriendsaysforQ1.wecanuse7777..18timesmod19=1sinceEuleroffi(19)=18...buthowcanweusethisFermat'slittlethmon"no.of
DIGITS"??
Showparent|Reply
bySageerAbdullaSaturday,6October2007,10:31PM
Reminder(2^1990)dividedby1990
InthiscaseN=1990=2.5.199
sofindthereminderwhendividedby199andmultiplyitwid2*5since2and199arecoprimes.againdivideby199ifitsdivisible..thatsthe
reminder..
supposeifweget25asreminderwhendividedby199.
multiply25wid2*5ie10.
wewillget250..whichshouldbedividedby199agiontogetthereminder..
thisshouldbethesimplifiedversionofanswer.
Showparent|Reply
byrishubatraMonday,8October2007,08:10AM
thanxfundoooforthismindblowingtutorial...itisofimmensehelp...butihaveabigdoubt...doesmodulararithmeticfollowtheserules?:
1.(remainderof1expression)*(remainderofsecondexpression)=(remainderofoverallexpression)
2..(remainderof1expression)+(remainderofsecondexpression)=(remainderofoverallexpression)
3..(remainderof1expression)(remainderofsecondexpression)=(remainderofoverallexpression)
doesthismeanif1998*1999*2000isdividedby47,wefindremaindersindividuallywithrespectivetermsintheexpressionnmultiplythemtogetthe
finalanswer??
Showparent|Reply
byShashankBalooniMonday,8October2007,11:19AM
HiFUNDOO.....Uhavereallyxplainedthedoubtslucidly.....Thanksalot
Ihave2questions...
1.39!dividedby41inthisquestionididntget40!=41K+40..
Somemorequestiononwilsontheorem...
2.PleasegivsomeexamplewherewecantapplyanyothertheorembutonlyChineseRemainderTheorem
14/51
8/14/2015
Showparent|Reply
byVarunChoudharyMonday,8October2007,03:01PM
@rishubatra
ThoughIwasnotaskedbutstillifeltlikeansweringit...
Answertourqstnisasimpleyes..
therulesaysthatalltheoperators(+,,*)remainastheyareandneedtobeoperatedontheindividualremainderswhichareobtainedbyseparately
findingoutremainderforeachofthenumerators..
Showparent|Reply
byShashankBalooniMonday,8October2007,03:12PM
Higuys
ThisseemsquietDiffprob..pleasehelp
mixed
Remainderfor..byChinesetheorem
(777)^777/1000
Showparent|Reply
byfundoobondMonday,8October2007,03:48PM
hirishu,
uhvaskedreallynicqnsnithinkishldhvincludedthesethingsinthearticle...butanywaysit'sbetterlatethannever...
ur1ststatement"1.(remainderof1expression)*(remainderofsecondexpression)=(remainderofoverallexpression)"
yesthisistrue...illtakedexampleuhvgiven....
1998*1999*2000isdividedby47
findremfor1998,itis47.sofor1999n2000itllbe48and49resp.
soremllbe24*25*26%47..
Showparent|Reply
bysachinsinghMonday,8October2007,07:43PM
Istheanswerforthisis72???
ihaveusedeulertheoremhere....confirmmetheanswer.
Showparent|Reply
bylovekumarMonday,8October2007,10:56PM
Hi
thereisaerrorindsolutionofex.tofindlast3digitof57^802whilecalculating(1000)=1000(11/2)(11/4),itshudbe1000(11/2)(11/3)as
1000=(2^3)(5^3)..
byentkcr
Showparent|Reply
byAmitChandaliyaTuesday,9October2007,08:14AM
hiall,
Ifindoneproblemwhilesolvingoneofthepapers.
15/51
8/14/2015
Q.whatwillbetheremainderif(2222^5555+5555^2222)isdividedby7?
plasegiveanswerwithcompletesolution...
Showparent|Reply
bysukshimanaikTuesday,9October2007,11:56AM
thanxalotsir.....ihavenotjoinedanycoachingcentrehere....asifindmorematerialsherefromuthananycoachingclasses......thesefundoo
theoramsrnoteveningoodbooks.....siriwillbeappearingcat2008&ihavestartedmyprep.onQAnow....butineedsomebasicsorcorrect
planning&methodtobestronginQA.SOsircanuhelpmetochooseacorrectpath....
Showparent|Reply
byVarunChoudharyTuesday,9October2007,01:17PM
@AmitChandaliya
HiAmit,perhapsthishasbeendiscusseintheforumbeforealso...
2222=7*317+3and5555=7*793+4
=>Qstnbecomes(3^5555+4^2222)%7
3^3%7=27%7=1
4^3%7=64)%7=1
=>3^5555=3^(3*1851+2)
and4^2222=4^(3*740+2)
now,wehavefirstpartofqstnas:
((27)^1851*(3^2))%7=(1)^1851*2=1*2=2
andsecondpartis:
((64)^740*(4^2))%7=(1)^740*2=1*2=2
Thereforeanswerwudbe(2)+(2)=0
Hopethisisafullsolution.....
Showparent|Reply
byVarunChoudharyTuesday,9October2007,01:24PM
@lovekumar
Ufoundamistakebutudidn'tlookintoitcarefully.Itsatypo(printingmistake)notanerror.
Thetypoisdat(1000)=1000(11/2)(11/4)shudbe1000(11/2)(11/5)asas1000=(2^3)(5^3)..=>uhavetotake2and5as"a"and"b"
respectively.
Theresultantvaluecomesto400only...
sosolutionisalright...hopeyougoturmistake....
Showparent|Reply
byShashankBalooniTuesday,9October2007,02:47PM
HiPLeaseSomebodysolvethisone
ThisseemsquietDiffprob..pleasehelp
mixed
FindtheRemainderforthisexpression..
(777)^777/1000
(Chinesetheoremmayhelphere)
16/51
8/14/2015
Showparent|Reply
byrishubatraTuesday,9October2007,07:42PM
hiall,
howdowesolvethefollowinproblem:
findtheremainderwhen123412341234.....(89times)isdividedby19?
Showparent|Reply
byAmeyaRaichTuesday,9October2007,09:47PM
tensdigitof2^999=?
Nowobviouslywehavetodivideby100andfindtheremainder.
IfweuseEuler,thensomethingsgoingwrongandicantfineoutwat?
See..
Rem(2^999/100)
=4*(Remof(2^997)/25)........(1)
Now::
Remof(2^997)/25
since2and25arecoprime.
Eulertotientof25=20,
Remof2^20/25=1
ThusRemof2^980/25=1.
ThuswehavetofindRem(2^17/25)
now,2^11/25yield24asremainder,weknow,
thus24*Rem(2^6/25)
=Rem(24*14/25)
=11.
Nowfromstep(1)abovefinalremainder=11*4=44.
Whereamigoingwrong???????
:::::::::::::::::::::::::ALTERNATE::::::::::::::::::::::::::
Rem(2^999/100)
=4*(Remof(2^997)/25)........(1)
now,weknow,rem(2^11/25)=1
thus,
Rem((2^990)/25)
=Rem(2^11/25*90)=1.
ThusweareleftwithRem(2^7/25)=7
nowfrmstep(1)above,
finalansweris4*7=28.
Whereamigoingwrong???????
?????????????????????????????????????????????????????????????
Showparent|Reply
bylovekumarTuesday,9October2007,09:55PM
hivarun!!
prettyrite..
thanks
Showparent|Reply
byRAMAKRISHNATANKUWednesday,10October2007,08:04AM
thankuufundo,itisveryusefulforme,iamverymuchinconfusionbeforethis.Anywayonceagainthanku
Showparent|Reply
17/51
8/14/2015
bymonuvarshneyWednesday,10October2007,12:27PM
AsthetheoriesgivenbyfundooandtGrfabulous.ButIhavesomequeries.
INwilsonstheory,howthe2ndexamplegives1remainder.pleaesomebodymakeitclear.Treatthisquestionasuhavenotdone1stexampleofsametheorem.
AlsoexplaintheWilsonstheoremmoreformyconvenience.
Showparent|Reply
byVarunChoudharyWednesday,10October2007,02:04PM
@AmeyaRaich
youaregettingwrongintheverypreliminarystep.
whichis2^11%25=1=>wrongbuddy
infactitshudbe2^10%25=1
Followtheverysamestepsthatuhavetaken.....
Youwillgettheverysameanswerinboththecaseandforureaseiwudsaytheansweris88
Alsousaidthat
Rem((2^990)/25)
=Rem(2^11/25*90)=1.
ThusweareleftwithRem(2^7/25)=7=>wrong,itshudbe3
nowfrmstep(1)above,
finalansweris4*7=28.
Iamrewritingtheabovestepswithcorrections
Rem((2^990)/25)
=Rem(2^(10*99+7)/25)=>(1)^99*rem(2^7/25)=>3=>22
finalansweris4*22=88
Showparent|Reply
byVarunChoudharyWednesday,10October2007,02:49PM
hieverybody.....
plzsolve(19^36+17^36)%111...
Showparent|Reply
byNareshKWednesday,10October2007,05:08PM
ThanxBond..Thatwasagoodcompilation
IfeltChineseRemainderTheoremtobealittleredundant.Franklywecanalwayslogicallyevaluatetheanswerinsuchgivenconditions.
Inurexample,3^101%77uhavearrivedatthenumberoftheform7a+5or11b+3.Sotheremainderwillbetheleastnumbercommontosuch
series.Quicklyitwillgive47!!
Lookingfwdformoretocome
Cheers
Neo
Showparent|Reply
byfundoobondWednesday,10October2007,06:17PM
HiShashank,
Areusuretheqn.is(777)^777/1000??Iamfindingitdiff.tocrackit...mightbeitis(777)^777/100??whtdousay?Anytakersforthis?but
franklyithinkuwontfindsuchpbmsinCAT...
regards,
fundoo
Showparent|Reply
byPavanPadekalFriday,12October2007,08:37AM
18/51
8/14/2015
Shouldntphi(63)inthefirstexamplebe36andnot18asmentioned?
Itdoesntmakeadifferencetothefinalanswerthough
Showparent|Reply
byShashankBalooniFriday,12October2007,11:01AM
hi
FundooBond
(777)^777/1001
oopstakethequestionasabv1000replacedby1001(7*11*13)
Showparent|Reply
byTotalGadhaMonday,15October2007,01:55AM
1.777777/1000>Remainder=797(UseBinomialtofindthelastthreedigits)
2.644
Showparent|Reply
byAnishRaiMonday,15October2007,05:48PM
NiceoneTG
Showparent|Reply
byHARIPOTTERTuesday,16October2007,08:57AM
hihaldi
canyouplsexplaintheremaindertheoremuused...
substitutionof10^2by2
Showparent|Reply
byHARIPOTTERTuesday,16October2007,10:02AM
hiTG
howdoufindlastndigitsusingbinomialtheorem....atmosthowmany'last'digitscanwefind....plsexplainhowugot797in777^777/1000..i
learnthowtofindthelast2fromyourposts...butlast3idunno..
thanks
Showparent|Reply
byfundoobondThursday,18October2007,07:30PM
hishashank,
ifthisistheqn...
(777)^777/1001
1001=(7*11*13)
sobasicallyuhavetofindremainderof
(777)^776/(11*13)
dothisbychinesethmandthenmultiplytheresultantremby7.
ifustillneedmyassistancedonebeafraidtorevert.
regards,
fundoo
19/51
8/14/2015
Showparent|Reply
byashishbhardwajSaturday,20October2007,11:50PM
hivarun,
itcanbesolvedusingchineseremaindertheorem
..(19^36+17^36)%111soiwilldividethisintotwopart
fist19^36%111andother17^36%111
soour111==>3*37bothareprime
soa=3nowwehavetofindtheremainderfor
19^36/3=>1=r1
19^36/37=>1=r2soand
ouraandbare3and37so3*x+37*y=1itgivesmex=12andy=1
so3*12*1+37*1*1=36+37=>1
nowsamewayitcanbedonefor17^36
so17^36/3=>2^36/3=>8^12/3=>(1)^12/3=>1
17^36/37=>1
soitwillalsofollowthesamepatternandanswerwillbe2=>1+1...
Showparent|Reply
bymojobondSunday,21October2007,12:00AM
HiFundoo
Pleaseclarifyonethinginthequestionwhichshashankaskedi.e.777^777/1001cancelling7leaves111extraalsoi.eitbecomes(777^776*111)/
11*13.Soaltho777^776/11*13ismanagablebuthowtotakeintoaccount111?
Plzhelp
Showparent|Reply
byambarpatilFriday,21March2008,05:49PM
findthelastthreedigitsof31994.
NowasperEulertheorem,Rem[3400/1000]=1.
Similarly,Rem [32000/1000]=1.Cananybodytellmehowdoweproceedfurther?Howdowehandletheextra36?
Showparent|Reply
byTGTeamSaturday,22March2008,01:40PM
findthelastthreedigitsof31994.
HiAmbar
HereIgo.
32000=36*31994=1(mod1000)
Let31994=x(mod1000)andas36=729
=>729x=1(mod1000)
=>729x1000y=1
NowusingEulid'sAlgorithm
1=3(1)1(2)
1=3(1)1(82*3)
1=3(3)1(8)
1=3(192*8)1(8)
1=3(19)7(8)
1=3(19)7(844*19)
1=31(19)7(84)
1=31(1872*84)7(84)
1=31(187)69(84)
1=31(187)69(271187)
1=100(187)69(271)
1=100(7292*271)69(271)
1=100(729)269(271)
1=100(729)269(1000729)
1=369(729)269(1000)
20/51
8/14/2015
=>31994=369mod1000
Showparent|Reply
byVipulPatkiMonday,24March2008,04:52AM
Toogood...SomeoftheproblemsaresolvedinArunSharma'sbookanditisalwaysgoodtoseealternativesolutionstosuchkindofproblems.
Regards,
Vipul
Showparent|Reply
byambarpatilMonday,24March2008,04:50PM
heykamal,
Thanksforpostingthesolution...butiamnotawareoftheEulid'stheorem...canyoupleasepostthattoo??
However,ihavefoundoneotherwaytosolvetheproblem
31994=9997=(101) 997.
nowusingbinomialexpansion,wecangetthelastethreedigits.theanswercomesouttabe369.
Showparent|Reply
byHungryGadha!Friday,18April2008,07:50PM
JustAmazingJOB.....fundoo..
fantastic...stuff.
Thanks,
HG
Showparent|Reply
byAmsKulSunday,4May2008,12:18PM
Hi Fundoo
Thanks a lot for the article ..
Showparent|Reply
byvamshimachanapallySunday,11May2008,12:30PM
Hi...Iwantthesolutionfortheprblemgivenbelow
whatistheremainderwhen7^7^7isdividedby13...
Thanksinadvance
Showparent|Reply
byvamshimachanapallySunday,11May2008,07:44PM
Higuys..gottheprocedure
Showparent|Reply
byaaMonday,12May2008,10:01PM
Hivamshi
istheanswer6???
pleaseconfirm
Showparent|Reply
byNikunjGuptaMonday,19May2008,09:11AM
21/51
8/14/2015
Hi....OnethingthatIamnotgettinginChinesetheormishowtosetvaluesforx,ybecausetheremightbethecasewhentherearemorethan2
valuessatisfyingeqax+by=1...foregwhatistheremainderwhenwedivide123456789by6.....
iamnotgettingtheansinanycase...
Showparent|Reply
byTGTeamThursday,29May2008,05:17PM
HiNikunj
Heregoestheexplanation.
Don'thesitatetoaskanythingwhichyoudon'tfollow.
Q.whatistheremainderwhenwedivide123456789by6
6=3*2
=>3x2y=1
bymereobservationwegettoknowthatx=1andy=1.
Now123456789=1mod2
also,123456789=0mod3.
NowusingCRT,
123456789=3*1*12*1*0=3mod6.
AlternativeMethod:
Rem[123456789]/6=Rem[3*41152263]/3*2=3*Rem[41152263]/2=3*1=3
Showparent|Reply
byBiswajitSenFriday,30May2008,03:53PM
howdoyousolve38!/41?
ifweusethesamemethodusedtosolve39!/41,thenitlookssomethinglikethis.
40!/41=40.39.38!/41
Remainder[40!/41]=Remainder[40.39.38!/41]
ie.40=40.Remainderof(39*38!/41)
thatmeansremainderof(39.38!/41)shouldbe1.
thatmeansremainderof(38!/41)willbe1/39??????
iamnotconvincedd.
pleaseclarify??????
Showparent|Reply
byakshaymishraSunday,15June2008,10:11PM
hiTG!!!
plzhelpmewiddisproblemrem(8^182)/65
iwsdoingitwidchineseremaindertheorem
65=13*5,>>>>>a=5,b=13
rem(8^182)/5=rem((8^45))^4)*(8^2)/5)=4>>>>r1
rem(8^182)/13=12>>>r2
now5x+13y=1>>>x=5,y=2
soar2x+br1y=212???????
icudgetdaanswerasfollows
phi(65)=48
rem((8^182)/65)=rem((8^48)^3)*8^38)/65
>>=rem(8^38)/65
>>rem((8^4)^9*8^2)/65
rem(8^4)/65=1
thrfre>>=rem(8^2)/65=64
butwatabtchineseremaindertheoremwatswrongwiddat??
Showparent|Reply
22/51
8/14/2015
byRamkrishnaRoyWednesday,18June2008,02:07PM
toooooooooooogood...thankyousir.
Showparent|Reply
bypraveenkumarFriday,20June2008,04:16PM
hippl,
imanewusertothisforum.Niamlikingit.Allsumsrinteresting.Andihvadoubt.Inthesumremainderof40!/83imnotabletounderstandhow
thefollowingsteparrivedfrom
(81.80.79..42.41!)%83=1
2*3*4*5....41*41!=41!*41!%83=(41!)^2%83=1
whichispossibleonlywhen41!mod83=1
becausethereareevennooftermssonegativesigngotcancelled.
Couldsomeoneexplainmethisone.
Praveen.
Showparent|Reply
byarpitmishraSaturday,21June2008,01:39PM
hineo.........
thisistheeasyques..........noneedtousechinesetheorem
8^182=(8^2)^91
=64^91
=(651)^91whichwhendivideby65givesremainderof1or64.......
Showparent|Reply
byBiswajitSenMonday,23June2008,10:59PM
higuys......thisisaninterestingquestionforalltoworkout...verysimpleone.....justasmalltrickinvolved....
ifA=33*32*31*30*29*28
&
ifRemainder[A/(12k)]=0......thenfindtheminimumvalueofk?
Showparent|Reply
byNeoSinhaMonday,23June2008,10:57PM
K=0
Showparent|Reply
byshivammehraTuesday,24June2008,08:59PM
plzhelp
thispartgoneoverheadtotally
Let31994=x(mod1000)andas36=729
=>729x=1(mod1000)
=>729x1000y=1
NowusingEulid'sAlgorithm
1=3(1)1(2)
1=3(1)1(82*3)
1=3(3)1(8)
1=3(192*8)1(8)
1=3(19)7(8)
1=3(19)7(844*19)
1=31(19)7(84)
1=31(1872*84)7(84)
1=31(187)69(84)
1=31(187)69(271187)
1=100(187)69(271)
1=100(7292*271)69(271)
1=100(729)269(271)
1=100(729)269(1000729)
1=369(729)269(1000)
Showparent|Reply
23/51
8/14/2015
bymanshulgoelThursday,26June2008,09:13AM
reallyawesomefabulousandexcellent...
ThanxxFundooBond..
udidagr8job..
Mindblowing
Showparent|Reply
byabhinavtripathiThursday,26June2008,11:43PM
thanksalotforsuchausefularticle...........
onethingwhichidid'ntunderstandwasywehavetoxpress
32^32intheform6k+r?????plzelaborate.....!!
waitingforreply
Showparent|Reply
bySurendranChandravathananTuesday,1July2008,08:13PM
Hi,
Thevalueofk=1forsure.
Bcoz12=3x4&wealreadyhaveone3andone4inthenumerator(ie,33=3x11,28=4x7).
SowhenAisdividedby12,surelytheremainderwillbezero.
Hence,Kcanbe1sinceminimumvalueisasked.
Showparent|Reply
bySurendranChandravathananTuesday,1July2008,09:02PM
Hi,
Thevalueofk=1forsure.
Bcoz12=3x4&wealreadyhaveone3andone4inthenumerator(ie,33=3x11,28=4x7).
SowhenAisdividedby12,surelytheremainderwillbezero.
Hence,Kcanbe1sinceminimumvalueisasked.
Showparent|Reply
byshubhamsinghTuesday,1July2008,10:42PM
theminimumvalueofkwillbe1.
Showparent|Reply
byshubhamsinghTuesday,1July2008,10:56PM
hineo.ucanfindouttheanswerbytheremaindertheorm.theanswerwillbe64
Showparent|Reply
byGauravVermaWednesday,2July2008,02:30PM
good,nicetheorems..itstimesavingalot..
pleasehelpme2solvethis:
findthe3digitprimeno.thatsdivides2000!dividedby1000!^2
24/51
8/14/2015
Showparent|Reply
byRakeshAgarwalSaturday,12July2008,11:28AM
hiiamanewuserouthere
andfounditaveryusefulforum..
nowGaurav
ithinkyourquestionisgreatest3digitprimeno.whichisafactorof(2000!)/(1000!^2)..
ifitissothesolutionishere...
ifyouselectaprimeno.say673
now2000!has2000mod673i.e2factorsas673and1000!has1000mod673i.e1factorof673so1000!^2has2factorsof673so2000!/(1000!^2)
hasnofactorsof673.
soallprimeno.sabove673willfollowthesametrend..
nowtakethecaseofaprimeno.lessthan673..
671isnotaprimeno.asitisdivisibleby11
also667isnoteitherasitisdivisibleby23
sonextprimenois661
2000!has2000!mod661i.e3factorsof661whichare661,1322and1983
since1000!has1000!mod661i.e1factorof661so(1000!^2)has2factorsof661
sowearrriveattheans2000!/(1000!^2)has661asoneofitsfactorandisthelargestprimeno.thatcandivide2000!/(1000!^2)
hopeugotthat....
tellmeifimwrong..plz
regards
Rakesh
Showparent|Reply
byPoojaSinhaTuesday,15July2008,02:07PM
Hey,
Thelastexample(whileexplainingtheconceptsi.e.Findtheremainderwhen8^643isdividedby132)thatwas
solvedhadmadeuseofEuler'stheorum,whereasItriedtomakeuseofChineseremainderTheorumbythe
followingmethod:
Break132into4and33andsince4and33arecoprimesthereforefind
Rem(8^643/4)=0=r 1
Rem(8^643/33)>Applyingeuler'stheorumwegetremainderas17=r 2
Hence,Rem(8^643/132)=4r 2x+33r 1ywhere4x+33y=1(x,y)=(8,1)
Hence,Rem(8^643/132)=4*17*8+33*0*1=544,whichisnottherightsolution.
Kindlyhelpandpointoutmymistakeintheapproachadopted.
Regards,
Pooja
Showparent|Reply
byamitprakashWednesday,16July2008,01:04AM
hisir...........imamit.....thewayyouaresolvingdproblemsisexcellant...itsrockingsir....
SirididntunderstandtheEuler'stheoremproperly.....mainlythesecondlineofthefirstexample........plzexplainagain........
Showparent|Reply
byinderpreetmakkarThursday,17July2008,06:29AM
Hey FB
25/51
8/14/2015
U truly are a bond with hell lot of fundas...
Thnx.
IPS.
Showparent|Reply
bypremdeepsinghThursday,24July2008,09:16AM
sir,plzgiveideahowtosolvearunsharmasolution
whatwillberemainder
2^2+22^2+222^2+2222^2+................+(222........48times)^2%9
Showparent|Reply
bypremdeepsinghWednesday,30July2008,11:22AM
higuyplzacceptchallengecat2008nov16
whatisremainder
2^2+22^2+222^2+2222^2.......................+(222......49times)^2%9
Showparent|Reply
bysahilaroraWednesday,30July2008,07:54PM
GreatworkBoss..UrtrulyTG(totalgenius....
Fantastic,Mindblowing!!!!!
Showparent|Reply
bysahilaroraWednesday,30July2008,08:25PM
hi...
couldyoupleaseelaboratemoreinsolvingtheabovequestion..
1990=2.5.199
fromEuler'sTheorem
phi(2)=1
phi(5)=4
phi(199)=198
//////////accordingtoeuler'stheormremainderof[2^phi(2)/2]=2^1/2comesouttobe1butitszero..couldu
pleasecorrectmeifminterpretingitwrongandpleasethrowsomelightonthepartrightbelow..thatLCMand
modthing...unabletogetit...////
2^4=1mod5(1)
2^198=1mod199(2)
LCM(4,198)=396
so
2^396=1mod1990
sonowweremainwith
2^10mod1990
1024mod1990=1024
Showparent|Reply
bysanjeevganeshSaturday,9August2008,02:47PM
HiADP,
26/51
8/14/2015
Anwertothe(2^1990%1990)isimpressive,butcanyouexplainstepLCM(4,198).WhydidyoutakeLCM?
Sanjeev
Showparent|Reply
byAnamicaSinhaSunday,10August2008,02:20AM
thanksalot.....!!!!!!!
It'sreallyagreathelp...forwedon'tfindthesesortofstuffsinbookseasily....thoughabitconfusingatfirst.....
WithsomanytheoremstosolvesimilarQuantsquestion....it'sabittoughtojudgewhichonetoapply...withoutmuchpractice....
Showparent|Reply
bysandeepshekharSaturday,16August2008,04:24PM
Thanksalot!Ialwayswonderedhowtoanswersuchquestions.Thisarticlewaswonderful.dokeeppostingsucharticles.
Showparent|Reply
byanjumorSunday,17August2008,02:46PM
PLZtellmesome1
howtosolve.........
1.(100/62)^1/4
2.(100/62)^1/5
3.(100/62)^1/6
Showparent|Reply
byanjumorSunday,17August2008,02:47PM
PLZtellmesome1
howtosolve.........
1.(100/62)^1/4
2.(100/62)^1/5
3.(100/62)^1/6
Showparent|Reply
byabhaydeolMonday,18August2008,12:21AM
helloTG
sirdouhavehardcopyofyourbookonnumbers....ordouhaveonlytheebookoption...ndsirwherearetheansofthesequizzesandlastlysirdo
yourcoachingclassesprovideanystudymaterialbycorrespondance...ifsomeonedoesntwanttoattendclasses....
sirdoreply
Showparent|Reply
bysanjeevganeshMonday,25August2008,05:12PM
Ihaveaquery.
IncaseofChinnesemethod:
1.Doweneedtocheckwhetherthenumberanddivisortobecoprime
2.Ifyes,canyouexplainmeyourlastexample8^643/132usingChinnesemethod
Pleaseexplain
Cheers,
Sanjeev
Showparent|Reply
bysanjeevganeshTuesday,26August2008,04:11PM
27/51
8/14/2015
Thankyouforthisbeautifularticle,
Whatistheremainderincaseof13^40mod49?
Cheers,
Sanjeev
Showparent|Reply
byarunilangovanWednesday,27August2008,05:19PM
hi,thisismyfirstposttoTG...
(2^2+22^2+222^2...(2222...48times)^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...(alltermsofform(a+b)^2,whereaisamultipleof9,like9,108,1107...)
4[1^2+2^2+3^2+...+48^2}%9.........(sincealltermsofforma^2+2abaredivisibleby9)
[4*48*49*97/6]%9
remainder=5...
pleaseletmeknowifthisiscorrect...
Showparent|Reply
byarunilangovanThursday,28August2008,11:57AM
(13^40)%49
thiscanbewrittenas...
=[(2*71)^40]%49
Bybinomialexpansion...
=(2*7)^4040C1*(2*7)^39(1)...40C39*(2*7)(1)^39+(1)^40
alltheoperandsintheaboveequationexceptforthelasttwoaredivisibleby49.Soweneedtofindtheremainder,whenthelasttwotermsare
dividedby49.
=>560%49+1
=7*(40*2)%7+1
=7*(10)+1
=70+1
=69
=49*269
=29
Hencetheremainderis29....
Somebodypleaseletmeknowifthisistherightanswer...
Showparent|Reply
byMukeshKumarSaturday,6September2008,06:14PM
don'thavewordstoexplainthebeautyofthisarticle..solvedsomedifficultquestionwithinsecond...thanksforthis
Showparent|Reply
byAKSaturday,13September2008,09:49PM
Thearticlehasmadelifeabiteasierwhenitcomestoremainders.
Showparent|Reply
bynimishvikasSunday,14September2008,12:16AM
28/51
8/14/2015
thankyoufandubond
forthiscompilationandyouefforts
nimish
Showparent|Reply
byanjumorFriday,19September2008,12:19PM
gudmorning...
Ihavesomeproblemsplzsolve.
1.Findremainderwhen
[(1^1+2^2+3^3+.....+9^9)+(10^911^8+12^713^6+14^5.....+18^1)]
dividedby19.
2.First99naturalnumbersarewrittensidebysidetoformanumber.
1234567891011............9899
findremainderwhenthisnumberisdividedby11.
3.Considera21digitno.12345678........
Findremainderwhendividedby11.
Showparent|Reply
byDebashish...Saturday,20September2008,06:15PM
hii...anju...isdanswerofd1stquestion0??ihavesolveditasfollows..
givenexpressioncanbewrittenas:
(1^1+18^1)+(2^217^2)+...+(9^9+10^9)
Since,(a^n+b^n)isdivisiblebya+bwhennisodd,
(a^nb^n)isdivisiblebya+bwhenniseven...
Hence...thetermsineachofthebracketsabovearedivisibleby19...Hencetheremainderis0.
Showparent|Reply
byDebashish...Saturday,20September2008,07:09PM
3.Ihavesolvedthisproblemusingremaindertheoremandgottheanswer7.isitcorrect?
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)
applyingremaindertheorem,since,11=10+1,
substitute1inplaceof10intheabovepolynomialin10...
weget,asremainder,
=(15+14+13+....10)+(98+76+...+1)
(i)(ii)
=70.
Nowthefinalanswerwillbetheresultof(70mod11)=7,indisstepihavewritten70as(10*70)mod11=7.(asremainderof1means10inthis
case).Dunnoifiamcorrect[
]...Docorrectmeifi'mworngsumwhere...thnkss.
Showparent|Reply
byaartikaushikSaturday,20September2008,11:49PM
ThnxsTG.
Plzsolvemyproblem.
Q.1Whatistheremainderwhen(1!)^3+(2!)^3+(3!)^3+(4!)^3+
(1152!)^3isdividedby1152??????
Q.2Whatistheremainderwhen2(8!)21(6!)divides
14(7!)+14(13!)?????????????????????
Waitingforurreply.
Showparent|Reply
byyogbansalSunday,21September2008,12:58AM
Ans2:2(8!)21(6!)=2(8!)3.7.(6!)or
29/51
8/14/2015
=2.8.(7!)3.(7!)or
=13(7!)
Now,remainderof14(7!)+14(13!)=remainderof14(7!)+remainderof14(13!)or
=14/13+0or
=14/13(ans.)
Showparent|Reply
byyogbansalSunday,21September2008,01:15AM
Q.1Whatistheremainderwhen(1!)^3+(2!)^3+(3!)^3+(4!)^3+
(1152!)^3isdividedby1152??????
Ans1:1152=2^7.3^2
Therefore,wecaneasilycalculatetheremainderofeachtermindividuallyhere.
e.g.alltermsafter(3!)^3arecompletelydivisibleby1152
hence,theremainderis225(whichisequaltotheremainderofthesumoffirst3terms).........Ans
Showparent|Reply
byanjumorSunday,21September2008,04:00PM
debashishthanksfordsolution.........
Showparent|Reply
byaartikaushikSunday,21September2008,05:10PM
Thnxs,
Iveanotherproblem.
Q.1Findthe28383rdtermoftheseries:12345678910111112...........??????
Showparent|Reply
bymohitsaxenaSaturday,18October2008,01:32AM
777^777/1000
1000&777arecoprime
weapplyeulerth.
1000(11/2)(11/5)=400
777^400/1000givesrem1
nowleftwith777^347/1000
1000=8*125
wedivideseperatelyby8&125
777^777/8
1^777/8
=1rem
777^777/125
777^100willgiverem1(aplyingeuler)
777^700willalsogiverem1
nowleftwid
777^77/125
27^77/125
3^231/125
3^100willgiverem1(eulerth.)
3^31/125
(3^5)^6*3/125
30/51
8/14/2015
(7)^6*3
24*3/125
=72
sorem=72
nowusingchinese
8x+1=125y+72
x=(125y+71)/8
=(5y+7)/8
=y=5
putyin(125y+72)
125*5+72=697
697istheans
bhaimarnamatgalthoto..........
Showparent|Reply
bypraveshbhutoriaTuesday,21October2008,03:08AM
hitg,
QUES.findthelastdigitoftheproductofall2digitnumbersthatgivearemainderof2whendividedby5?
Showparent|Reply
bySoftwareEngineerTuesday,21October2008,12:22PM
pravesh,Isit6?
SE
Showparent|Reply
byTGTeamWednesday,22October2008,12:07PM
HiPravesh
Smallestandlargesttwodigitnumberwhichgivearemainderoftwowhendividedby5are12and97respectively.
Sototalsuchnumbersare=(9712)/5+1=18eachgivingaremaindertwo.
Henceproductoflastdigitsofallthese18numbers=29*79=2*7=4
Showparent|Reply
HiPravesh
Smallestandlargesttwodigitnumberwhichgivearemainderoftwowhendividedby5are12and97respectively.
Sototalsuchnumbersare=(9712)/5+1=18eachgivingaremaindertwo.
Henceproductoflastdigitsofallthese18numbers=29*79=2*7=4
Showparent|Reply
HiPravesh
29*79=2*7=4
Showparent|Reply
bySoftwareEngineerWednesday,22October2008,06:39PM
31/51
8/14/2015
oftheproductofall2digitnumbers..........Imissed'2digit'part
andgot2^10*7^10=4*9=6
Showparent|Reply
bypraveshbhutoriaThursday,23October2008,01:53AM
hikamal,thanksforattemptingthisques,butiwasnotabletounderstandthelogicbehind(9712)/5+1suchnumbersandhowcomethereproduct
willbe29*79.sowilluplsexplainitthoroughly?
Showparent|Reply
bypraveshbhutoriaThursday,23October2008,03:45AM
hitgsir,
ihaveaconceptualdoubt.whatif,inchinesereaindertheorem,
N=a*b*c.ThatisNhas3primefactors.canthechineseremaindertheoremstillbeapplied.ifsothenhow?whataboutax+by=1inthatcase?
Showparent|Reply
byTGTeamThursday,23October2008,03:51PM
HiPravesh
Let'stakeanexample:
What'llbetheremainderwhen1111... 2008timesisdividedby1001?
NowletthenumberisN.
Also1001=7*11*13
SoN=4mod7=0mod11=11mod13.
Using.2*(11)3*(7)=1
=>N=(2*11*43*7*0)mod77=11mod77
Using,(13)*6(11*7)=1
=>N=(13*6*1111*7*11)mod1001=11mod1001.
Showparent|Reply
byPushpenderPannuTuesday,31March2009,10:12PM
hellocananybodyhelpme
of63isgivenas18.Itshouldbe36?
Showparent|Reply
byAnkitaChowdhuryWednesday,1April2009,08:33AM
HiPushpender,
63=3^2*7
phi(63)=63(11/7)(11/3)=36*6/7*2/3=36
Showparent|Reply
bysanjeebpandaSaturday,4April2009,08:51AM
ThanksSirforthesetricksandexamples..
Plssirwriteasmuchaspossiblebecozithelpstousthosewhoareunabletotakeoradmitintoyourclassroomcoaching.
ThanksSir.
Showparent|Reply
remainderof2^1990/1990?
bykundankumarTuesday,21April2009,02:12AM
pleaseexplainweremigoinwrong
32/51
8/14/2015
2^1989/995
2^1980*2^9/995
2^1980*2^9/5*199
[nowbyeulerstheorem2^1980leavesremainder1whendividedby199(phi(199)=198)]
thereforewerleftwith2^9/5
whichleavesremainder2
butreadingtheabovethread1024isthecorrectans...
Showparent|Reply
byVibhorGoyalSunday,10May2009,01:40PM
HiKamal/TGsir
Ihaveadoubtinthesolutionprovidedfortheremainderwhen1111... 2008timesisdividedby1001.Inthe5thlineofthesolution,theremainderwhen
1111... 2008timesisdividedby7istakenas4.Thevalueaspermycalculationis5..canyouplstellmewhereimmakingamistake??whatididwas:
with1>1
11>4
1116
11115
111112
1111110
11111111
andsoon..
hencefor2008timesdigit1,remaindershouldbe5.
rgds
Showparent|Reply
byGowthamMuthukkumaranThirunavukkarasuWednesday,13May2009,05:47PM
howtosolve
55555.........93times=5(1+10+100+........+10^98)
=5((10^99)1)/(101)
therefore,
thereminderwhenthenumberisdividedby98is,
=5*10^99/(9*98)5/(9*98)
=0
Ihopethatthisisright.Ifthenumberwasprimethenucouldusetheconceptthatanysingledigitnumberrepeated'n'timesisdivisibleby'n'
provided'n'isprime.
Showparent|Reply
byAshutoshSinghMonday,18May2009,12:49PM
Reallyaveryhelpfulandeffectivearticle.Aneyeopener
Showparent|Reply
byvakatibabuThursday,28May2009,09:35PM
fortheveryfirstquestion
5^37/63
howf(63)=63*(11/3)*11/7=18.itis36
howitisconfirmedthat
5^18/63remainderis1
Showparent|Reply
byvakatibabuWednesday,3June2009,12:09AM
ineuler'stheorem
cansomeonepleaseexplainthecalculationofthefucntion
pi(n)
Showparent|Reply
byNabanshuBhattacharjeeWednesday,10June2009,11:59PM
33/51
8/14/2015
Iapproachsuchproblems,inwhichthenumeratorandthedinominatorhassomecommonfactors,inthefollowingway
1)takethecommonfactorsouti.e.dividebothnumeratoranddinominatorbytheirHCF
2)Findtheremainder(nowthenumeratorandthedinominatorwouldbecoprimes)
3)multiplytheremainderwiththeHCF
Sointhisproblem,wecanwrite
21990=2*21989
1990=2*5*199
phi(5)=4
phi(199)=198
LCM(4,198)=396
therefore2396=1mod995
thereforeremainderwhen2^1989dividedby995is29
hencetherequiredremainderis2*29
Ithinkthisclearsalotofcloudonthetheorybeingappliedhere
Iamnewhere...correctmeifIamwrong
Showparent|Reply
byNabanshuBhattacharjeeThursday,11June2009,12:21AM
1001isabeautifulnumber.anythreedigitnumbermultipliedby1001resultsinthenumberwrittentwicei.e.abc*1001=abcabc
intheprob1111...2008timesisdividedby1001
111111isdivisibleby1001(111*1001)
thatmeans111.....2004timeswouldbedivisibleby1001
(111111*1000001000001000....etc)
thatwouldleaveuswith1111
theremainderwouldbe110
@pravesh
IthinkthebestapproachinsuchcasesisbytakingLCMs,andthengettingasmallernumbertodivide
Showparent|Reply
byNabanshuBhattacharjeeThursday,11June2009,12:24AM
Haveacrackatthis
remainderwhen72!isdividedby73*36!
(Idontknowwherethisproblemappears.IgotthisfromafriendthroughSMS.HopefullyIamnotinfringinganycopyright
Showparent|Reply
bySaiShyamKolachalamaSaturday,13June2009,09:48PM
Thanksamillion...Ialwayswantedtoknowhowtosolvethesekindofproblems...
...TG..uRock...
....andfundoo...urule..
Showparent|Reply
bynehalahotiSunday,14June2009,01:53AM
HiTG
34/51
8/14/2015
iusedsomeothermethodtosolve32^32^32whendividedby9,bymymethodiamgettingremainder=2when32^32^32isdividedby9.
wecanwritethequestionas2^5^32^32where5^32^32canbewriitenas3k+1wherekisanevennumber.
sonow2^3k+1dividedby9willgiveyou2astheremainder.Couldyoupleasepointoutmymistake.
Showparent|Reply
byKulvirSinghSunday,14June2009,12:35PM
@Neha
Justthinkaboutthisquestionandyouwillgetwhereyouarewrong..
(8)^2=(2^3)^2=2^(3*2)=2^6
Nowwhatyoudidwronglywaswritingthegivenquestionas2^5^32^32whereasitshouldhavebeen(2^5)^32^32=2^[5*(32^32)]
Showparent|Reply
bynehalahotiMonday,15June2009,12:29PM
HiKulvir.
Thankyouforthesolution.Ihaveadoubtwhichis:
(111..7)timeswhendividedby7willgivearemainder1andif(111..14)timeswillalsogivetheremainderas1whendividedby7.?Isthiscorrect.
Couldyouexplainmethelogicbehindthechinesetheorem.Imeanhowisitderivedsincethrhastobealogicbehind...thanks
Showparent|Reply
byKulvirSinghTuesday,16June2009,01:40PM
@neha
Itsanextensionoftheactualtheoremstatingthat111111willbecompletelydivisibleby7...So,useitinthisformonly..Thisautomaticallyanswer
yoursecondquestionthat111...(14times)willactuallygivearemainderof11i.e.4with7..It'sbetterformofthesametheoremna..??
Idontknowtheexactproof,buticantellyouthelogicbehindthis..
10^6willgivemearemainderof1with7(fermet'stheorem)
Hence10^61shouldbedivisibleby7..
Hence999999shouldbedivisibleby7..
9*111111mustbedivisibleby7...
Since9isnotdivisibleby7,111111shouldbedivisibleby7..
Andhence222222,333333andsoonwillallbedivisibleby7..
Thesamecanbeextendedbytoallprimenumbers..
Showparent|Reply
bynehalahotiTuesday,16June2009,05:56PM
HiTG
Thanks...Thissiteis2gud2btrue!!1moredoubt!
#howmanypairsofxandyexistforwhichthe
eq:sqrtX+sqrtY=Sqrt1332holdstrue.Couldyouplzsolveit.ItisoneofthequestionsfromTGquizzes.Aresolutionsgiventothequizzproblems
onthesite?Thanks
Showparent|Reply
byKulvirSinghWednesday,17June2009,09:07AM
@neha
Theanswerwillbe5...Thesolutionarenotthereinthatquiz...ActuallyiwouldsuggestTGtomakethesolutionsavailablebecausethatwaywecan
learnvariousaproachestosolvetheproblemsonvariousconcepts...[Andhey!!Youcanevenchargesomechhoticamountforthat...
Wellnowtakingoverthebusinessmanpartofme,thesolutionforthisquestion...
rhsofthequestionafterfactorisationgivesmesqrt(36*37)
Thatcanbewrittenas6sqrt(37)
Nowekchhotacaconcept...Iftherhsoftheequationhassqrtof37,bothsqrt(x)andsqrt(y)shudhavesqrt(37)init...
Nowthequestionreducesto
asqrt37+bsqrt37=6Sqrt37
Hencea+b=6
(a,b)canbe1,52,43,34,25,1
Andsubsequently,valueofXandYcanbefoundout...Hopeiamclear...!!
Showparent|Reply
35/51
8/14/2015
byKulvirSinghWednesday,17June2009,09:42AM
@remainderwhen72!isdividedby73*36!
Theanswerwillbe27*36!
Showparent|Reply
byNabanshuBhattacharjeeSaturday,20June2009,04:09PM
Howdidyougetit?
Showparent|Reply
byAntonioBanderasWednesday,24June2009,03:37PM
goodarticle..cheers
cananyonehelpmewiththis??
find28383rdtermofthefollowing123456789101112...
optionsare3,4,9,7..
myansweriscoming3..butitswrong
diditbytaking19>9*1digits
1099>90*2=180digits
100999>900*3=2700digits
total=2889digitsof1,2and3digitnumbers.
so,4digitnumberswillhave283832889=25494digits
sotheactualnumberwillbe999+[25494/4]=7372
whiledividingwith4wegetremainder2sotherequireddigitisgoingtobe3aswe'llhave73727373...andsoon
whatamidoingwrong??
Showparent|Reply
bykartikjaniThursday,25June2009,02:37PM
bytheway...63(11/7)(11/3)=36not18asumentionedafterintroducingthefirsttheorem
kindlymakethenecessarychangesifpossible...
averynicearticlethough
moreoftheseexpected....
alsowatwillbetheremainderif34!isdividedby73...
somequickandhelpfulmethodpls
Showparent|Reply
byAhefazKhanThursday,25June2009,09:16PM
ThisisbyfarthebestarticleIhaveeverandwillevercomeacross.Iamabusinessjournalistandjustwonderwhyareyoupeopletakingameasured
approachandnotcomingoutinabigwaywheneverytom,dickandharryisresortingtoeverypossiblegimmicktoreachouttoCATaspirants.
Showparent|Reply
byKulvirSinghFriday,26June2009,09:18AM
34!isdividedby73
Theanswerwillbe36...Noquickmethodtogetthisone...Youwillhavetoinvestagood3,4minutestoreachtotheanswer..
Showparent|Reply
byKulvirSinghFriday,26June2009,09:23AM
@AntonioBanderas
IguessyouhaveseenthisquestioninArunsharmawereintheanswermightbegivenassomethingotherthan3...Butyourapproachandansweris
correct...Eveniamgettingtheanswertobe3only..Ithinktheansweriswrong..Kindlytellfromwhereyouhavetakenthisquestionsothatthe
credibilityofanswerbeverified..
Showparent|Reply
36/51
8/14/2015
byAntonioBanderasFriday,26June2009,01:22PM
yeahitsfromSharma..wheretheansweris9..
here'sanothersum
p=1!+2*2!+3*3!+........+12*12!
what'llbetheremainderwhenp+3isdividedby13!?
myapproachisthis
foranynumberwecanusethefollowing
whenwehave1!+2*2!+3*3!+.....+(n1)(n1)!thisformanditisdividedbyn!theremainderis1...
(egofveremainder:ifwehave23/6,wecanexpress23as6*41(6k1)
orwecanexpress23as6*3+5(6k1+5))
eg:asin1!+2*2!+3*3!whendividedby4!willgive23/24...
hereremainderis23whichwecanwriteas24k1...soiwritetheremainderas1...thus23=4!1
thusinthegivensump/13!willgiveremainderas1and3/13!willgiveremainder3..
thustheremaindershouldbe31=2....
ihopemymethodisok..idon'thavetheanswertothis.
ifanyonegetsadifferentanswertothisorhasadifferentmethodpleasedoshare...
Showparent|Reply
bysrinivasanraviSaturday,27June2009,12:31PM
hiall,
anyoneplshelpmetosolvethisproblem,
ifx=777...777(1017arethere)
thenwhatisxmod440?
thanks..
Showparent|Reply
byAntonioBanderasSaturday,27June2009,01:09PM
wellherexwillbedivisibleby440ifitisdivisibleby4,11,10(440=4*11*10).
11'sdivisibilityruleis(sumofodddigits)(sumofevendigits)=0/11k
hereifwetake987'sthenwehavethefollowing
777777......98digits000+777
thenumber77777....98digits000isdivisibleby11(49*749*7=0)
isdivisibleby4(endingwith30's)
isdivisibleby10.
soanswershouldberemainderof777/440=(777440)=337
isthistheanswer??
Showparent|Reply
byKulvirSinghSaturday,27June2009,02:12PM
Yourapproachtoboththequestionsiscorrect...Andboththeanswersarealsocorrect..
Showparent|Reply
bysrinivasanraviSunday,28June2009,08:36PM
thankyouantonio..thisistheanswer..thanksalot..
Showparent|Reply
byNabanshuBhattacharjeeMonday,29June2009,01:55AM
Kulvir,
37/51
8/14/2015
abouttheprob72!dividedby36!73
Theapproachifollowedis,
take36!outfromboththenumeratoranddenominator,
Thenewnumerator,37.38.39.....72,letuscallitA,canbewrittenas
(7336)(7335)(7334)etc,
SoA%73issameas36!%73.,letuscallitx
HencetheAnswertotheproblemis36!x
Now,72!/73is1or72
i.e.36!.A%72=1or72
i.ex^2%73is1or72
1.ex^2=73k1
Itoogot27byinspection,butthatistootedious.Pleaseshareyourapproach.
Showparent|Reply
byabinabrahamMonday,29June2009,09:17PM
JustMarvellousmostremainderquestionshadmestumpedevenbeforeicdstartthinkinonthemnwivegotrtdconcepts
Showparent|Reply
byKulvirSinghMonday,29June2009,11:43PM
Wellialsodidsomethingsimilarbutabitsmaller.Butbeforegoingintothesolution,iwouldliketoputforththatsuchquestionsareverylesslikely
tocomeinanexamlikeCATbecausethereisnoshortmethodtosolveit.Itsjustamatterofanepiphany.
Wellhereismyapproach..
72!mod73=1
(72*71*70*.......36*35*34*.....*2*1)mod73=1
(1*2*3*4........35*36)*(36*35*....2*1)mod73=1
(36!*36!)mod73=1
(36!)^2mod73=1
Nowhereisthecatch..Tome,itstruckbychancethatsince27*27=729givesaremainderof1with73,(36!)mod73willbe27..
Hence34!*35*36mod73=27
34!*19mod73=27
19a=73b27
Fromhere,valueofbwillbe9...
Andhence,ais36..
Quitealongsolutionactually...
Showparent|Reply
byarvindkumarThursday,2July2009,12:13PM
beautifullexplainationthankyuousosomuch.
Showparent|Reply
byChingLeeFriday,3July2009,12:45PM
@GowthamMuthukkumaranThirunavukkarasu
withregardtoursolutiondated13May,2009....
Coulduplsexplainthelaststepofuransweri.e.
Remainderof5*10^99/(9*98)5/(9*98)
=0
Howcome?
Showparent|Reply
38/51
8/14/2015
byChingLeeFriday,3July2009,12:52PM
@NabanshuBhattacharjee
couldyouplsthrowsomemorelightontheLCMapproachthatyouhavementionedinoneofurposts.Thereis
only1examplewhicheveryonehasrepetitivelyexplainedfortheLCMapproach.Couldugivemeanyother
examplewhereinuhvusedthisapproach.
@all
ormaybesomeoneelsehasotherexamples .
Showparent|Reply
bySidhantBansalFriday,17July2009,04:24AM
thanxalotTG....awesomestuff!!
Showparent|Reply
byManishKumarSaturday,18July2009,05:50PM
Hi,
Gr8article...
HadfewdoubtsintheaboveexplanationofexampleinEuler'sTheo:
1)Howcome63(11/3)(11/7)=18andnot36?
2)1000(11/2)(11/4)=400andnot375?
Thanks,
Manish.
Showparent|Reply
bytarunbhavnaniFriday,24July2009,02:03PM
justdidtheexercise..
uvemadefindingremaindersoeasy...thnxTG...
Showparent|Reply
byAsthaJalanMonday,27July2009,10:53AM
Hey,
Hodowefindtheremainderof12^107/37?
thanks!
Showparent|Reply
byronakpatelMonday,27July2009,05:59PM
hi..
isthatans1?
byeuler'stheorem
phi(37)=36
thereforerem[12^36/37]=1
nowrem[12^107/37]=rem[{12^(36)*3}/37]*rem[12^1/37]
=1*rem[1/12*37]
=1
amiright?ifwrongsomewheremakemenoticeit...
Showparent|Reply
byshalinjainMonday,27July2009,08:23PM
findtheremainderof55555....93timesdividedby98
ThisquestionwasaskedbyMr.Subhadeepdas,2yrsback,on28thSeptember2007.Ithinkithadbeenlostinthe"deluge"ofTGfollowers'queries
.
Firstofall,Mr.Gowtham,thisremaindercannotbe0astheNr.isODDandDr.iseven.
Wecandoitthisway..
39/51
8/14/2015
111111isdivisibleby49.
So111111....90timeswillalsobedivisible.
So,
[5(111111...90times*1000)+555]/98
1stpartoftheadditionwillbedivisibleby98completelyas1111...90timespartisdivisibleby49and1000isdivisibleby2.
Nowwhen2ndpart555isdividedby98,65willremain..
Ithink65shoudbetheanswer.
Correctmeifimwrong.
Showparent|Reply
byaashishbialaTuesday,28July2009,02:54PM
hiTG
itsamazingworkyouaredoing.inthisworldofmoneymakersyouaredoingsocialserviceandthattoowhenyouknowthisistheonlywayyour
workisgoingtobeapplauded.GoodjobdoneTG.
keepupthegoodshowandcheers!!!!!!!
thanks
AashishBiala
Showparent|Reply
byswatijainMonday,10August2009,04:56PM
HiTG..
Wannnaknowhowdoweevaluateremainderwhnquestionislike
a/b^n..Canitbesolvedbychineseremaindertheorm?
Showparent|Reply
byadityakaulTuesday,1September2009,02:36PM
Iguessyouaregoinginthelaststep.Ifyoutakethenegativepowersthenanypowerof12canhenceforthbeprovedtohavearemainder1.Iamnot
sogoodwiththeoremsandhencecantgiveyouacorrectreasonbutwhatIcangiveyouisacorectsolution
rem[12^36/37]=1
nowinthiswayrem[12^108/37]=1
thiscanbewrittenas..rem[12^107/37*12/37]=1
nowrem[12/37]canbewrittenas12or25
nowletssayrem[12^107/37]isx
thenrem[x*25/37]shouldbeequalto1
thiswillhappenonlyifx=3asrem[75/37]=1
hencerem[12^107/37]=3or34
Ans34
Showparent|Reply
bymultiloopWednesday,2September2009,04:04PM
Hi Mate. Kudos to you for putting up this article. It presents the requisite stuff in a
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).....
40/51
8/14/2015
Qn.N=7777.....7upto2n+1digits,n>3.Findtheremainderwhenit`sdividedby1232.....?
Sol.1232=7x11x16
N=7p=11q+7=16r+1forsomevaluesofp,q,r.
Tryingtosolve7p=11q+7...As11qshouldbeamultipleof7,wetryq=0andgetp=1.
So,Rem[N/77]=7i.e.77p+7=16q+1or16q77p=6
p=2andq=10satisfyit.Hencetheleastsuchnumberis16(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.....
Showparent|Reply
byAshwinAgrawalFriday,11September2009,01:10AM
excellentinfo...keepupthegoodwork...
Showparent|Reply
byshivanshtyagiFriday,11September2009,11:45AM
ihadaprb1^39+2^39....................12^39dividedby39whtstheremainder
Showparent|Reply
byjansivaSaturday,12September2009,04:57PM
Extremelyusefulwithallconceptsmergedintoonearticle...thankyousomuchTG!
Showparent|Reply
byRajuSinghMonday,14September2009,11:04PM
Cansomeonehaveshortcutsmethodtogetremainderofthebelowexpression:
(26^5+27^5+28^5+29^5)dividedby110?
Optionsare
1)0
2)2
3)55
4)4
5)5
Showparent|Reply
byKarthikeyanSanthanamTuesday,15September2009,03:19PM
Ansisoption1)0since
a^n+b^n+c^n+...isdivisiblebya+b+c+....whennisodd.
Showparent|Reply
byRajuSinghTuesday,15September2009,06:14PM
ThanksKarthikeyanSanthanam
Butcouldyouprovidemegeneralawaytosolvethistypeofquestion,supposeifnwouldbeeventhenwhatshouldhaveonesapproach?
Thanksonceagain.
Showparent|Reply
41/51
8/14/2015
byROHITKWednesday,16September2009,02:45PM
HiRaju,
(26^5+27^5+28^5+29^5)dividedby110
Expressionisoftheforma^n+b^n+.....
Weknowthat..
a^n+b^n+.....%(a+b+..)=0whennisodd(whichisinthiscase).
Hence,
(26^5+27^5+28^5+29^5)%(26+27+28+29)=0
(26^5+27^5+28^5+29^5)%110=0..voila!!
HenceOption(1).
Checkiftheansweriscorrect..
Hopethishelps..
Rohit
Showparent|Reply
byROHITKWednesday,16September2009,02:42PM
HiShivansh,
Q.1^39+2^39....................12^39dividedby39whtstheremainder
1^39+2^39....................12^39isdivisibleby(1+2+...12=6*13=78),sincepowersareodd.
Also,
78=39*2==>Anumberwhichcanbecompletelydividedby78canalsobedividedby39.
Hencetheremainderis0
Checkiftheansweriscorrect.
Hopethishelps...
Rohit
Showparent|Reply
byRajuSinghThursday,17September2009,08:18AM
@ROHITK
yaugotthecorrectanswernIunderstandurapproach,itwasquitehelpful.Thnksbuddy
Showparent|Reply
bykushalmasandSaturday,26September2009,01:45PM
tooooooooooooooogoooooooooood
thanx!!!11
theyhelpedalot.
Showparent|Reply
bySudiptoJanaFriday,30October2009,09:17AM
Heyguys...canutellmetheanstothis:
Findtheremainderwhen3^1000/91.
Itssimpleyettheansissimplyeludingme...
SOS!!!
Sudi
Showparent|Reply
byparulagrawFriday,30October2009,09:57PM
HiSudipto
42/51
8/14/2015
ansIgotis81.pleasecheck
Showparent|Reply
byvershajhunjhunwalaTuesday,24November2009,12:17PM
hey....pleaseletmeknwhwtodothat???
[{6^11}^7]findthelasttwodigit...
pleaseletmeknwhwtododatwdeuler'smethod..orifnyodermethoduhave..
pleaseexplainit......
Showparent|Reply
byNitinKumarTuesday,24November2009,11:32PM
Heydoitusingchineseremaindertheorem,
taken=1,thenN=7777777,whichneedstobedivededby=1232
1232=77*16
a=77andb=16
N/77=>r1=7
N/16=>r2=1
R[N]=a*r2*x+b*r1*y>>>>77x+112y
ax+by=1
77x+16y=1>>>>x=5andy=24
R[N]=2303whichisequalto1232*22303=161
Showparent|Reply
byarunilangovanWednesday,25November2009,04:45PM
hi...ifyourquestionis(6^11)^7...thenitcanbewrittenas6^77...
R(6^77/100)..ifyousee,theremaindersofthepowersof6whendividedby100followthepattern(forthelasttwodigitsas...)
06,36,16,96,76,56,36,16,96,76,56,36,16,96,76,56...
when77isdividedby5(theintervalforthepattertorepeat),theremainderis2...so,whenthepatterfollowedis
06
36
16
96
76
56
36
16
96
76
56
36
16
96
76
theremainder2pointsto36...sotheremainderis36,whicharethelasttwodigits..
Tryoutthesamewhenuwantitfor6^(11^7)
Showparent|Reply
bykanikakalraThursday,26November2009,11:18PM
hii
7^7/114and7^3/114=1
=>7^7=7^6.7=>qstnbecomes7/114=ans=7canuxpalindisstep??
Showparent|Reply
bykanikakalraFriday,27November2009,03:42AM
43/51
8/14/2015
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
Showparent|Reply
byarunilangovanSaturday,28November2009,02:54AM
hi...urquestioncanbereframedasR(45^36/1000)...
45^2=2025..when2025isdividedby1000,thereminderis25...
soweeffectivelyhavetofindoutthereminderof25^18whendividedby1000...
25^2=625and25^3=15625...when15625isdividedby1000,thereminderis625andsoanyfurthermultiplicationof25willstillgivethereminder
of625..
sothefinalreminderis625...andthenumberinthehundredsdigitis6...
Showparent|Reply
bykanikakalraSaturday,28November2009,05:30AM
thanxzatonarun
Showparent|Reply
bykanikakalraSaturday,28November2009,05:45AM
hi
723243+318243isdividedby17?
temehw2goabtit?
Showparent|Reply
byShankarananthMCSaturday,28November2009,08:11AM
Hi,Cananybodytelmehowtoproceedwiththissum.
Remainderwhen21^22isdividedby125..Iknowitskindasimple.Butitsjustiamnotabletogetit.
Thanks
Shankar
Showparent|Reply
byShankarananthMCSaturday,28November2009,08:17AM
(a^x+b^x)isdivisibleby(a+b)ifxisodd.
inthesumx=243isodd,hencetheexpressionisdivisibleby(723+318)=1041.
1041isdivisibleby17andsotheremainderiszero.
Showparent|Reply
bykanikakalraSaturday,28November2009,05:36PM
heyshankaranathan
soryydanss9.cansumbdytemedsoln?
44/51
8/14/2015
nya!!temedanswerofquesuaskd!!21^22%125
isdans1?
Showparent|Reply
byarunilangovanSaturday,28November2009,07:41PM
hikanika...since723and17(and,318and17)arecoprimes...whenudivide723^16kby17,wegetreminderof1...so723^243canbewrittenas
723^(16k+3)andsotheeffectivereminderweneedis723^3whendividedby17,whichisR(723/17)*R(723/17)*R(723/17)=R(9*9*9/17)=
15...similarlyfortheotherpart,youwillfindthereminderis11...sothetotalreminderis26andhencewhen26isdividedby17,thereminderis9...
Showparent|Reply
bykanikakalraSaturday,28November2009,07:56PM
thanzarun!!datwsgr8!!
Showparent|Reply
byarunilangovanMonday,30November2009,06:30PM
heyshankaranthan...21^22mod125canbesolvedthisway...
21^22canbewrittenas(20+1)^22...
andtheexpansionofthiswillbe...
20^22+(20^21*22C1*1)+...+(20^2*22C2)+(20^1*22C1+1)asimplebinomialexpansion...
apartfromthelastthreetermsalltermswhendividedby125willgiveareminderof0(sincepowersof20,morethan3aredivisibleby125)..
sothelastthreetermsgiveus...
400*231+440+1
whenthesameisdividedby125,thereminderis25*106+65+1
sotheansweris25+65+1=91...
is91theanswerforthis???
Showparent|Reply
byrajgoyalTuesday,2February2010,11:15PM
heyithinkyouarerightuptosomeextent..
butlaterinyursolutionithinkitcanbedonealsoqiththehelpofextendedecluidalgo
andthatwilllgiveanswertobeequalto368andthatcanbecalculatedmuchfasterrateandmorequickly..
Showparent|Reply
byAspirendAchieveMonday,3May2010,04:00PM
Phi(63)is36not18..
Showparent|Reply
byshailmishraThursday,26August2010,07:52PM
hi
cananybodytellmethesolutionofthefollowing?
5^400dividedby1309.findtheremainder.
ans:1
pleasetellmeifitcanbedoneusingeuler'stheorem.
Showparent|Reply
byGauravVermaThursday,26August2010,07:59PM
HIsahil..seethisthread:http://totalgadha.com/mod/forum/discuss.php?d=6268
Showparent|Reply
byshailmishraMonday,30August2010,08:05PM
theabovementionedlinkstildoesn'tcontainthisformofquestionasherefi(n)=1309(11/7)(11/11)(11/17)
=960
i.egreaterthan400.
45/51
8/14/2015
pleasetellthesolutionsoon.
Showparent|Reply
byGauravVermaTuesday,31August2010,09:58PM
Findthelasttwodigitsof2^2^2003..plzposttheapproach
Showparent|Reply
byshubhamguptaThursday,2September2010,03:49PM
istheanswer2?
Showparent|Reply
bynikitadhanukaTuesday,21September2010,01:19AM
last2digitsisremainderondivisionby100.
consider100=25*4.nowfindtheindividualremainders.
with4,theremainderisclearly=0.
now,25iscoprimeto2.hence,wecanapplyeuler'stheorem.
thetotientfunction=25(11/5)=20.
thismeans2^20mod25=1
nexttaskisexpressing2^2003intheformof20a+b
ondividing2^2003by20,theremainderis8
2^2003=20a+8
2^(20a+8)mod25=(2^20a.2^8)mod25=1.256mood25=6
so,theremainderwith4is0andwith25is6.thesmallestnaturalnumberwhichsatisfiesthisis56.accordingtochineseremaindertheorem,thisis
theremainderondivisionby100andhencealsothelast2digits.
thelast2digitsare56.
cheers!
nikita
Showparent|Reply
bysuniltiwariTuesday,28September2010,07:42PM
helosir
yourarticlesareverygood
buttherearealotofmistakes
likeeulerstheorem
andfermatstheorempleasecorrectitotherwiseitisverrygood..........
@(63)=63*(11/3)*(11/7)
thiscalculationiswrong......
itshouldbe24
manysuchmistakes...
Showparent|Reply
bySukritiBabbarTuesday,5October2010,10:11PM
Pleasesolve:remainderwhen2^133isdividedby133
Showparent|Reply
HiSukriti
133=7*19
Sofindtheremainderof2133with7and19individuallyandthencombinethemusingChineseRemainder
Theorem.
Showparent|Reply
46/51
8/14/2015
byNishitVoraMonday,25October2010,01:22PM
Heycananyonetellmehowtosolvethis?
x2222....16timesdivideby17givesremainderof0
Findx
Showparent|Reply
HiNishit
2222.... 16times isdivisibleby17.
Infactanyrepuniti.e.anumberformedbyrepeatingsamedigitp1timesisalwaysdivisiblybypwherepisa
primenumbergreaterthan5.
Showparent|Reply
bySandipanSarkarTuesday,9November2010,08:27PM
Cananyoneplshelpmetofindtheremainderof28!whendividedby67....anyshortcut!!!!
Showparent|Reply
byAseemPahujaSaturday,13November2010,04:31PM
Thanksalotsir
Showparent|Reply
byparasaroraSunday,14November2010,10:15AM
128^100/153.???
plzsolvedis
Showparent|Reply
byshivammehraSunday,14November2010,04:13PM
42....isitcrrect?/
Showparent|Reply
byDipakSandWednesday,13July2011,10:23PM
Withallduerespect!theequationax+by=1inthechineseremaindertheoremshouldbeax+by=1elsethesolutionwillbeincorrect.
Showparent|Reply
byAdhaarkhannaTuesday,9August2011,05:00PM
toogud....thanx.....
Showparent|Reply
byvishnuvardhanTuesday,23August2011,12:42PM
exlntpage
thanxalot..ithelpdmealot
Showparent|Reply
byabhinayduttaSaturday,27August2011,03:33AM
1000=2^3*5^3
a=2
b=5
r1=rem(777^777/2)=1
r2=rem(777^777/5)=2
47/51
8/14/2015
5x+2y=1
so,x=1,y=2
removerall=5*x*r1+2*y*r2
=5*1*1+2*2*2=3=10003='997'
correctme,ifitswrong.
Thanks
Showparent|Reply
bynehaaggarwalThursday,12July2012,06:45PM
HiKamalSir,
Inthisques:
What'llbetheremainderwhen1111...2008timesisdividedby1001?
Inthisreply:
Let'stakeanexample:
What'llbetheremainderwhen1111...2008timesisdividedby1001?
NowletthenumberisN.
Also1001=7*11*13
SoN=4mod7=0mod11=11mod13.
Using.2*(11)3*(7)=1
=>N=(2*11*43*7*0)mod77=11mod77
Using,(13)*6(11*7)=1
=>N=(13*6*1111*7*11)mod1001=11mod1001.
Plsexplain:
Using.2*(11)3*(7)=1
=>N=(2*11*43*7*0)mod77=11mod77
Using,(13)*6(11*7)=1
=>N=(13*6*1111*7*11)mod1001=11mod1001.
Showparent|Reply
byTGTeamThursday,12July2012,09:10PM
HiNeha
Thanks for revamping these age old posts again. Actually these are simply application of Chinese Remainder
Theorem(CRT)whichTGhastaughtlongbefore.Youcansearchforthemintheforums.
Regarding this question, we could 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
123456789with1001,itissimplysameastheremainderof123456+789=456with1001i.e.456.
Thereseemssomeerrorinthesolutionprovidedbyme.Kindlycheckandgivemethecorrectanswer.Seeifyou
candoit.
Showparent|Reply
byPraveenPatelWednesday,18July2012,11:45AM
@ADP
itisclearbutcantbeabletogetehyyouhavetakenLCMoftheeulars?
Showparent|Reply
bynehaaggarwalThursday,19July2012,12:53AM
HiKamal/TGSir,
Canyoupleasetellmehowtogetthesolutionsforthedifferentquizzesnumbersystems,geometryetc.Itwillbereallyhelpful..Evenifitrequires
registrationpleasetell..Willbeofgreathelp..Reallyexpectingareply..
Thanks,
Neha
48/51
8/14/2015
Showparent|Reply
byTGTeamThursday,19July2012,10:12AM
HiNeha
YoucanpurchasetheEbooksatthispageCATProducts,whichcontainsolutionstotheproblemsinquizzesatthis
site.
Otherwiseyouarealwayswelcometopostyourdoubtsandgetthemsolvedhereonly.
Showparent|Reply
byneetaSSunday,2September2012,02:56AM
Inyoursolutionyousaidxcanbeonly2or81.Howtofindthesevalues.2canbefoundbytrialanderror.Buthowtofind81?
Showparent|Reply
byrakshitsaxenaSunday,23September2012,10:58AM
awesomearticle..althoughicouldntunderstand..how3^41/77became..3^4/77...plzsomebodyexplainthistome..
Thanks
Showparent|Reply
bynavyaVELURITuesday,6August2013,12:32PM
in3^41,wearesplittingthepower,sothattheno.achievedtherebyis>77tobedivisiblebythat..
so,considering3^4=81,whichis>77,andtherem=4..(3^4)/77=4..
3^41=[(3^4*10)*3]/77
=[(4^10)*3]/77
Showparent|Reply
byashishmishraSunday,25August2013,11:11AM
Isitageneralrule...ifp^(a*b)/c*d.....andifp^a=xmodcand...p^b=ymod(d)......thenp^(Lcmofaandb)/c*d..theremainderis
x*y...................??????
asstatedabove....intheproblemremainderof2^1990/1990......2^4=1mod5(1)
2^198=1mod199(2)
LCM(4,198)=396
so
2^396=1mod1990
var__chd__={'aid':11079,'chaid':'www_objectify_ca'}(function(){varc=document.createElement('script')c.type='text/javascript'c.async=
truec.src=('https:'==document.location.protocol?'https://z':'http://p')+'.chango.com/static/c.js'vars=
document.getElementsByTagName('script')[0]s.parentNode.insertBefore(c,s)})()
Showparent|Reply
byRaviKumarDiwakarSunday,20April2014,02:15PM
2^11/25yield23asremainder
Showparent|Reply
byAdityaKukretiThursday,14August2014,01:19PM
pleasefindtheremainderfor(4^79)/81usingeuler'stheorem...
Showparent|Reply
byTGTeamFriday,22August2014,12:16PM
HiAditya
479=2158and81arecoprime,sowecanapplyEuler'sTheoremwhichsays2phi(81)=1mod81.
Nowphi(81)=81(11/3)=54.
49/51
8/14/2015
So(254)(254)(254)=2162=1mod81
i.e.24(2158)=1mod81{let2158 =xmod81soweneedtofindxonly}
i.e.16x=1mod81=80mod81=16(5)mod81
i.e.x=5mod81=76mod81.
KamalLohia
Showparent|Reply
byShrutiPithadiaFriday,14November2014,12:45PM
IhaveadbtinexamplesofEuler'stheorem..
1.hwcome63(11/3)(11/7)=18??shudn'titb36??
2.nalso1000(11/2)(11/4)=400??shudn'tbe375??
Showparent|Reply
byTGTeamFriday,14November2014,03:42PM
HiShruti
Yesyouareright.Thanksalotforyourcorrections.
Butitisnotgoingtohampertheanswerthough.Thesearelittlehumanerrors.
Infirstquery,certainly63(11/3)(11/7)=36andanswerwillbesameasgivenonly.Rathercalculationsteps
willdecrease.
Insecondscenario,it'sjusttypoasphi(1000)=1000(11/2)(11/5)=400andnotaswrittenthere.
Ihopeitclearstheconfusion.
KamalLohia
Showparent|Reply
byShrutiPithadiaFriday,14November2014,04:42PM
Ohkk..Thankssir.
Showparent|Reply
byvinaygundechaSaturday,15November2014,07:21PM
45^36=2025^18
lasttwodigitsmeansreminderwhendividedby1000
rem(45^36)%1000=rem((81*25)^18)%1000=25*rem((81^18)*(25^16))%40
Take25common
25*1*25=625hencehundredthplacedigitin6
Showparent|Reply
byvinaygundechaSaturday,15November2014,08:05PM
@sudiptojana
ANS=81
byeulerstheorem
91=13*7
thereforeuler'stotientfunctionis72
rem3^72%91=1(1000=72*13+64)
thereforrem3^1000%91=rem3^64%91=rem81^16%91=(81*81)^8%91
=rem9^8%91.............as81*81%91leave9asreminder
=rem81^4%91
=rem81%91=81
Showparent|Reply
50/51
8/14/2015
byVishalyadavFriday,13March2015,04:49PM
BUTIN2^1990MOD1990,2AND1990ARENOTCOPRIMESOHOWCANWEAPPLYEULERTHEOREM
Showparent|Reply
MBACATGMAT
Youarenotloggedin.(Login)
51/51

Remainder Theory

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

Remainder Theory

Uploaded by

Copyright:

Available Formats

8/14/2015

Home Forums CAT2014QuantLessons ModuloArithmeticRemainderTheory

You might also like