0% found this document useful (0 votes)
28 views33 pages

CH 6 Number Theory

Chapter 6 discusses the concepts of primitive roots and exponents in modular arithmetic. It outlines the conditions under which integers can be classified as primitive roots and presents theorems related to their properties. The chapter also includes examples and proofs to illustrate these concepts in the context of modular equations.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
28 views33 pages

CH 6 Number Theory

Chapter 6 discusses the concepts of primitive roots and exponents in modular arithmetic. It outlines the conditions under which integers can be classified as primitive roots and presents theorems related to their properties. The chapter also includes examples and proofs to illustrate these concepts in the context of modular equations.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 33
Chapter: 6 “Paimtwe Roots & Inoces” nent of an intexey Modul Let m>1 be an eae and a be ony interer Such thet gcd (tm) =4 then a east ave integer Ris Called — (ovder) of a modulo yn £ OL” = A (mod) SY FARS=1 and olso — gaa(ns) =! ale (eas) 412 4 (mod 5) a SY (mods) 2 G = \ (meds) a? = 3 (mds) s ate! (mds) ‘fe 2 1s expeneat of (mod) > fede expres of 2 (meds) oa 5 sit aenoasY THEOREM. Bowman Let a be on inheger Tring exponent “$" (modm) ther OHA 4 (medm) => RIK iy If a=b (mdm) Then exponent of bb (ppodyn) is alse “f” ti) G*SAd (mdm) ey is] (med) Proof. : Poefe 6 i exponent cf 0 (medm) do cea) mde) D Let ake SI (modm) but a= 4 (medi) where £ és least +E integer te RS By division algorithm Keka ta fr Lack Of ahY*4 (modm) Fak = Gh Q® (medm) » hay (modm) => £5 (MV o% (mdm) adhaks\ (modw) Scanned with CamScanner D> ata (medm) for of 4¢h ® = Ris least 4ve integer or uahicl ab = 4 (nedm) So kz0 Ke hy => A|RHS 4. ¥] LHS Heme RK. (Paved). i) A=b emedm) > ahs B (modm) > 1 =O) (modm) + Oa A (mode) > Pat (mdm) 2S i Syrmebsic Adati > Exponent f b (med) = eo. ii) Consider 5G : Cae as cae ‘TAHIR MAHMOOD > al 4 (modm) MC ernie > (med) - least 4ve inbeger he 2 ae ~ isfy (med R) Conversely Suppo isj (med £) > Rlij ov injahy fryez > abd = ah (nod) > Gd = (ANT (puedo) > al. Bb = 4 (nedm) = ak =a! (med) al = cd (mdm) << t=} (mah) = as (nsdn) Hevea eek is expert ofa" (rtm) fen of has expert Wy chow d= ged(&,k). Parfs Suppte tbe the expenoct of al (ed) lm CAK)E 24 (ued) _ Scanned with CamScanner ®@ > ote 4 (mmedm) + Exponent ef a mdm) i& which is leat He tae ahich al = 4. (moda) > AK ger(hk)=d > dR and dlk > Reda ad kads fr A, SEE, wt ged (4s)=) » R]kE = dn | det => lst PAE os ged (4,5)7 1 vad >A 7 Blt —o Also (ax = ( a4)" nam) s Keds = (ays (ANY (ons = Mads = (anys (Imodm) = (4) modm) 7 he (rodm) = msdn) Bat is smalest for which (OM) 4 trod m) > tly —e Fom @ ad @ as rte toh oe aes Hence exponent of OK (medm) is By (Paved) it * Tieonem: Leta hes exponent “f" maduilo m then of has expend Ro msdulo m wilh qca C&W) =4. Pref. = a has exponent HK (mod) te ah = 4 (modm) We have to shoo: ak has exponent K (mdm) Given tet cach, Wed Suypeie ok has exponent + (mdm), thes (ar =I (madm) Scanned with CamScanner > des (ned m) But A is Least sve ihe fr abe A (gnedm) > K]ke > &\t ged (hk) =! _9 4 Als. (aky* = ahs (red m) CK (mod) » abst (modm) L (rod) but + is exponeat f ak (modm) be + is Smallest r : Consepontly 41K A iD Gam © aud © nn oa ns te ‘SS ale Cus exponen! of aK (edn) is Bo (Pavel) fa WW Primitive Root (modm) Let m>! amd a be any ink er fucls hat gcd (4,m)=) then “a’ is called primitive Agot (med m) f ag =1 (ned m) ie a is pit Ao (med m) uf exponent of a (nedm) is Cm). Question:. Find all primitive Acots (omedS) ip ( ; gls)=4 aud 152,34 ave Copaime th fat (mls) => 1 is mt paioine Aco (medS)os Rat PIs) Nw atee (reds), 2am), PSS —neds) 5 OSA (med 5) > Fe4=$5) 2m punta bedioctt) Mo '=3 (wel), SU nd5) 3% Dfnad5), 34=1 (mel S) > K-42 P(s) & 3 is Phimitive Aaat (ned). Scanned with CamScanner © Noo 4! 4 med 5), YE! (med 5) > Featdls) & 4 ts not peinitoe Acot (mods) Honea 2 and 3 are primitive Annds (mod). nl abe Ticmnem. — = oe Has prone act (aed) in 1a, G---, @ is RRS (red m) Tae + 13 primitine Aest (med) fo ged (am)> } Also gcd (aX, m) =! VE, ofS $(m)-1 > Aaja. bm! a. matually Co- prime bom. ity Now we have te show that t,a,a% .. Suppese fr aisal > abd =A (medm) but PM (med m) fr $ (m) det ue integer Pom) > im | iGonw Fy {mod peony] => But of Ly) & 40m) 1 which is U pats ¥ ijee whi is impratle s tej Hs al od (red) Consepertly 14,4, a®-! are inGycpuont (med). iy Let A={a,a,.. Aen} be an RRS (mod) and A be an inteper Sach that ac4 (4 m)=! hin A= ried) f Some unique f Auch hat ge PO) But 1,.a,a%,.. 0 O)-| are n= Congaueat (nde) tv bey s oe LS POH- 4s i <$(m) Pl are Copsime to Im Soler dome at 1 that “oS RA Hlm-1 There exist ign j Buch that lege ee) aud ak = 4) (rodn) __@ Scanned with CamScanner Fram © ond © Lea Hena 4,0, a4», q@l-l is an RRS (ned m). a Tf 7 hes primitive joo} Bam it hod exaclly (dim) Poof . of Supp. 2 be pram hoot (onudon) (em at) (mdm) "If a has exponaut & fradn) ton a Bd exponent ¥ (rds) fr ged (RK) =I A (Thus all oltar primitive Avots are fhe rrumbers Jam eh faratar., a} fos which gabsPlm)=/ (Ahese ore infact [$0] in rurmbers Heo oon ras exactly P[ Hm] piinibve Aook Phim =< Tresem:. - five Avot (medm). ah is pisitive Aoct (onedm) df" ged (k, Plm))= 4 Posh Given hat Q is prnie Aoot (neelm) t. ats fund) Spee ged (lm) = 4 We have t Show that aX is prioitve reat (mado) For this, we have b bhow that “Q& has expinent Pim). CL eaponoul 4 aK (medm) ts “Eb” fn it a4 (med m) => akt = 4 (nedm) But $m) is Bast pre tntyger for which AP 4 unde) Scanned with CamScanner @ > gon | Kt ged (k, P(m)) = > ¢im/t __@ tae E WO Cape (ah Goud) = (1% (modm) = 1 (medm) But ak hes exponeut t fo tis Smallest +ve integer uch Kat (ahit= 4 Grodm) + +t / dim —©O Une 0 aud © t= Pim) 4o exponent of ak is Pom — (ned m) | Hone ako ow prnitie root (meoel™) Gonverely Suppate ak is puinite rool (merlm) We have fat ged (K, $(m))=1 aX is puimitie rat (rmdm) do exporuel of AX (mdm) = $m) show te Be $(m « Exprud ef a ish (mnedm) Thee enout of lS (ynad) Ss A eae > gc (KPO) =) Hence Acquired Aesult is prvel- ali 7 EQREM:. pnp eo mie aie Suppoe a be proitioe Aat Grdp) fen SP) sa (nod) Scanned with CamScanner a ee a abet (md) a f,a, 0%... alt is an RRS (medp) AL ai, ad are imcanguent (medp) fir 06 Cs Pod Now using Theorem ais pote rect of Thon of is iu Ant ef b f aud only f qe (Ky pet Corsequestly il primitive Arots re ef the form aX mya pene nt f Pom of ii whi aP-? od ged (Prva! Tia thy are

a $00") : a = 1 ed 2") Ss e > ak" = 4 (yal a) S| which Contradicts @ No Heme our Suppesitim cs voremg Mat a is primitive Aaot belonging tb Pre { p Consequently athe ts no paimitine Asst Dalonging te o". ——— Scanned with CamScanner aslo bt ® — If ged (mn) =4. fod m>2, n>2 fhin mn has mo painitive Tet. fa Seppe on Contry that 4 is pani dive vot cf mn SS then ace (a, mn)=) > ed vs m)=1 = aed (a,h) Also exponent of a ts (mn). qed (ay) =! and ac (an)=1 So by Euler [Resren ) at (nodm) ond ae 4 (med) M>r sn>2 so $m) ond (0) are beth even > ged (Om, d0n) 7 2 | $0 90) hem) den) 2 7 fon) En ed ($60), D0) aeoem) = 2 2 PEP > 94 Gor doan > R 2 dm) de» Gnsidy gh SEER froin) = + Fir gcd (mm)=d \ pind _ POND Ln) 2 °)) “Get REH dnedoy POOIM = tepne = 1 (modym) => fern) ® Pm) Hn). Hm) pir) Abe Gh a Boldin t6 (mdn) ptm) Po) __ [oP] F4C¢601,90) (mnedn) = 1 (medn) mw ake! (edn) ond ah =| Grodn) for ged mn) 2. g a* =/ (mdm) but AL D(mm) Here our open a aheng Mat a £3 paimito Aost Cnt puny We 8 To Piiritire soot of rm. Scanned with CamScanner a all primitive yrotS (red 7) iy Find all pAimitive routs (ned to) ily Find all paimitive vooks (ned !2) wiv) Find all Painitve yrots (nds) v) Find all phimitie vote (medi). > aad vir Find all phimitive yoote (med 13) eS wi Find all’ phinitve rooke (ome |?) & ra De Reo Shins < geyat ye + 12,3486 are Copdime 7 (rmtt) , 24 nad?) , 2°33) (amed?) > B=349(1) to 2 is nef piimnitioe (md 7) 23 Gned7), 3°22 (rol), 3°26 (med?) 5 Bel fomed?), 3° S (red?) Hel Grd) te Fab = Pl) te 3 is paimitioe retomed3) G'S (melt), We 2 (ned), GPa | (oned?) RSET) de Y is nat primitive root (med?) 5'25 (mod?) , 57=4 (med?), 5? a bl), 5's 2lml?), 53 (ned 2) s‘2 1 (mdz) fab =$l7) to S is primitive rot (med 2) 6126 Ged?), 6721 Gned?) 2 fea dpla) x & it mot paimitioe it (med?) Grsequently only Primitive nots of 7 are 3,5: ——— iy» Pl) = P(axs) = Pla) PS) = Ixhe 4 Alse integers Gptine A fo ore 4349 33 (onedie) , 3°= 9 (odie), 3° Tonedte), 3°=I Ged ®) > Reh= $l) we 3 5 primitive Avot bed ts) . 77 Cred), 7 Gomdt), 7% 3 (onde), Th 1 (gnedes) > Ka4= Ole) & 75s Phinitive root (ged 10). 9'2 4 (ede), 9°21 (nsdis) => F=2 # Pl) > 9 & met primitive reat (med). Hence only primitive revs af 10 are 3,7. Scanned with CamScanner ® E _ Clemly = 1d whee YP2, 372 ad ged (4,3)m) Af ged(mn)=1 and mag, nrg Thin Share ism phioihive. rot (mod mn) > Ter is mo phimitive Avot (nedi2), pom 7) Clearly $= 3x5 whe 379,579 ond g4(o5)=1 2 Af ged(mp)=! and m>2, 72 hen Mere ism Prirntive ok (medn) > han ism pamitive Yet (med 5). " Clearly Wb= 24 eer . ; oA ed Tere is 2 primitive rot (oned a") ¥ mz3. i > There is mm hint Avot (med tk) wee fee vi) Cleasly H3)= 12 Hi number of primitive rot py = Hf Hla)) = Hiar= $(302°) = (3) bla) = ax (a2g) = ax(u-a) = axae y Firstly ,we find # primitive Act (med 13) 22 (melts) 254 (med13) 228 (mal) Be3 quar) 2°26 (medi3) 22/2 (mnall3) 2425 (omedi3) ale (aedi3) 259 (ned 3) 10 2/510 (ads) 2'= 7 (med 13) > Fa12=$(I3) fe 2 is primitive soot (med 13) £If ais pAimitive Azct (med m) ion aX is primitive doot med m) D ga her) 2751 (amd 13) Now integers G-plimete 12 ave 1,5,7,0 as primitive wots of 13 ore 2), a, a7, a" =2,6,1,7 = 26,71 Scanned with CamScanner vir + gtin)= |b 8 Te mumber of plini Hine Auots of I7 = [Hin Pluy= POY = ALP -e=? Fiastly, we find pointe Avot (medi?) giea(omiz) Se Pini) Sen(mnie) — 321% (med 9) 352 S (dle) 3Xo1S(omdi) SFzti (modi) 3516 (oned 7) Ble Ih (media) 9°= B(madiz) glee (medit) «BEG dl) Bid (mind dep (mai g%=b (md) glel (melt > Felk= Pl) a 3 paimtioe foot (gned 1?) fo fa 1s pine dala) ah pote Lill if gle $1 Bos inhers Coopaine b 6 are 35,79, W139i Tua print seats of 1 ae 3, 33344 3 3? 3° ” oe = 30,5, 147512, Ke ; = ih = 35,657, 02,14 we oe Deore Tigre exist atleast one pi Hive Aept modulo each odd aime: Sef. Let p be odd paime den idee We want to shoo hat p has ables} ona pionifve root fe. an inlger oP epenent $ (ple po} «pr is prime Bere exist atleast one tntgger a guarated ach hat ae a&p-l bach thet ya (A, p) =I % Fermeté Little Theorem a = (ned p) > of-'= 4 (medp) > exponent of Gedp) = pol = $(p) Heme. a is paint root (rudp). Conse pently ove prime pa has atleat on prinitie root. ___ Scanned with CamScanner ® Lemma: — If p is an as pie rem [are exit a pote dost 4 P Buch Mat My 4 (rtp?) Pref. =p 1 0d pine as Bare exist o primitive At rm ov] a. f 4 ov (red) then throm hls tive xf P “24 op) the Ze Atp (mel) 1 als panitive root Gosek Pl ah” wp By Bina) Thearem fr tie fers a Ee AP peal p (oned P) Atle (Pvp he (mot) A fool) Pe leprae pat? (rned 4) AM 1 pal Creede) . FI pal A is primitive hoot (edb) a gale pe! > gel (As py=i 7 PY pay ow pyal Howe ye +41 (ma ) which Completes the poet Scanned with CamScanner ® Lemma | 4 p be an odd prime and let A be primitive hoot ofp wilh he property that A? le. map) Then fr each tye integer Keen AP CPD 24 (med BS), eof We will poe if malkematiced inductirn on k Tf K=2 fem sesult holed 4 preceeding Kiorem (lemma) hm fe ai being painitve Aost ap AP ge 1 (med PY) > Peper Seppe Aasult hotels for B72. Go = Ai ON £ (med PS) x We want t pave le ae » kis paiontive kot 7p Be ged (4p) 2 gt (Ae ga apes By Euler Treorem plea (en a) > APO OPIL Gnd po) (PFO) =P] en, ‘HMOOD ocraawe e) o PUN) cap fa ace > Pb). Lea pe) hunt pha 4 inductive hy poles > (one (140 pe (By Bins Trem) AP") = 14 pK (med pt) py pe gh (pH) ae matt ed Tae om Scanned with CamScanner_ © aut ZiigoREM:- If p is an odd prime and K74 then there exists a paimitive Aat fos py Ard. Suppose A hes onder mn (mad pS) then ged(oph)=4 to Ps 1 (modbk) _@ By Euler3 theore 5 7 ™ fe yy (ned p®) Pp) - (p= PL pe oat mp _@ FHM Me + 1 is okdey of A (mod pS) & n is least 4ue inbeger em) Cp » ged (As =I & ged (plat , ond PIP bat yp] AM > plan oe AM = 4 (mod) Consequenty pt | m Seon asumes the form od n=p"(P-!) whe ofms K-] JE om PE\Cpar) then P*(p-1) is divisible by n ond gh (PL (rea) which Conthadiets @ Hone m= PE"Cha) = Cp) and mb) (ed) sh is pamitive Avot of pk. hus for odel hime p and Kt, PS has a phimitive rat. es __# Scanned with CamScanner © ak Callaky :- Tee are paimitive reels fos ap whare P being odd pline and K7 4. Pf. Suppose A bbe phimtive Kat for PS at p i add prime and ko 4. We assume 4 is odd integer : If Aix evenihon A4ph is ded SHI primis Aol for P Hera ged (A,aptet o qa (A pha 1= ged (4,4) ake onder fh (ned aK) = Se A” 2A (med ap) New 1 should divide P(ap= $2) O(p)= 2-0 $I) = Pp) te 7| bern 2 AP =A (ned ap) => A721 (ned pS) aC But A is prinitive hoot (med py) > 4¢p)|m > $=)" _© By O amt@® nz $ (8p) Gosequnty A is p&imitive Avot for aps. Hena primitive Aosls exist -for ape whameveh p is odd prime and Ky 4. Qwestion:?} Find all primitive Aoo ts(med 5*) saltfplathenl iy Find all pmitve fests (aed 72) fii Find alll paimitive Aoots (aed 3°), Scanned with CamScanner ® Sialion. iy = (SD = 4 and alz2 (mas), AEM dS), as3eels), ax Alms) > 2is prenitive Avot (med S) a expanest of (neds) == 5) Noo No. of primitive dots (ond S") = $( 45») = p(sts) => (a5) =P Oo) = o(axsd= PO). P(S) 2 (aha)(s-1) = (4-2) (4)=@Nw=8 Now integers Go-prime te (5%) = 0 are 1,3,7,9,44,13 17,19 4 is pinitve Aet fir lien a primitive tal fo BP gea(K PG) =1. Hener primitive Aoots fir 5” ave al, ®ajal,ala® al all (med Saas) => Primitive Aosts are 2/8, 3,12, 23.17, 23,13 (mud S*) Hones primitive hots for 5” ave 2,3, 8,12, 13,17, 2a,a3. iy = B(7)=6 — and 3'a3 (mi?) 3B Qlmd7) , B= L (med?) Y= 4 (md?) , 35S (mod?) » Zed (red?) 23% primitive Acct (med 7) 0 expo of 3 (med?) = 6 = (7) Now NecoP aimitive Aas (rd 7°) = $($(77)] = $(72-7) = P(49-7) = (ur) = $ (2x3x7) = (a) $(3) (7) = (2-1) B-1)(7-1) = beaten Now ikegors G-prime to $(7*)=h2 are 4,511, 13,17, 19, 23, a5; 24, 31, 32, 4) * Os primitive dot for p MRim a is punitive rat for Pe at &F0))= 4. Hence paimitive Aosts (med 7*) are a3 Po Hees paadtccy, 3,37) 3, 37 3!1, 7 395 379, 39), 3°73, 3? oo Scanned with CamScanner > Primitive nats are 3,47, 12,10, a6, 38, 40,17, 5,45, aly, 33 (maz) Hema primitive Aoots (med 7*) are 3,5,10,12,1F, 4, 26,33, 3, 40,45, 47. — iii) = $(3)=2 and ala (mds), 2 at (mel 3) > 2 is primitive Acet (mods) a4 exponent of 2 (mats) = a= 40) Now No. of paintin Aaks (md 3°) = $[>(s)] $(a%34) = $(ar-a)= PO) (3a) = O64). $0) = (3%3)(at) = (4-3) (I= bx =f Now integers Co-prime te P(3%)= 18 are Cista, 13,4F- G1 is primitive took for p Then aX is. primitive dost for BP iff ga (&9(py)=t- Hence primitive Avots -foa 3 ave - 2!, 2%, al, al, al? all | Raa xr => Primitive Aocts are 2,5, 20,23, 11,14 (med 3°) Hone primitive hoots (med 3°) are B51 44 00,20, nou ——— Ihdex of ‘an inkger Aelatioe to Primitive Roct:- Let a be a paimitive edt (ged m) and b be an integer Suchthat ged (bym)= 4 then K (asve integer) is Called indo of b (mnedm) Aelative to a f b = ak (mdm) Mathematically denoted a5 Indb=K oy Ind b = K- Index of Zero Aatetive to any primitive Acvt (ted rm) is undefined- Scanned with CamScanner seed © Example: Let 3 be primitive Avot (mod 5). List all indices of 4,2,3,4, le Lategors(b) b=ak (meds) k= Indb- a 133° (mas) Int =0 2 2 23° (mols) Ind,2 = 3 3 323! (mds) Ind,3 =4 2 Ind,4 =2 Hence, . b 4 2 S) 4 Ind b 0 3 4 2 le THEOREM: Let a be paimirtive hoot (medm) and b,c ,K be any inlegers then a If b=c Gndm) > Ind, b = Ind (med m1] wii) Ind. (be) = Indb + Ind,¢ (med 0m)] ily Ind, BS = K. Ind, b fmed 6m] i) Ind, 4 = 0 [med $(m)] Veeck. ee" el spa ee A=Ind.b ond S= Inde Sh b= at (mdm) and aS (medm) i) Consider b=c (nedm) > akzaS (medm) > a= 4 (mdm) Um) but Q is pAimitive Ant (modm) 46 ‘= 4 (mdm) when Cm) is least +e integer te tim) | A-s > Az=S (red &(m)] = Ind, b = Ind [omed $(m)] (Proved) Scanned with CamScanner il) Consicler be = ataS (modm) > be = QhtS Gmedm) yf 4 = Ind, (be) tien be = of (ynedm) > ak = oft (medm) > at-4+9 4 (medm) But a ig primitive pect (edie) + aa 4 ned) whee $m) 5 Least tue integer so hm) | (ats) > t = AS (med Him) > Ind,(be) = Ind.b + Ind, [med (m)] (Faved). Supe t= Ind, US thon B= alt (mot) Indb=h => lily b= a* (medm) > = (at) (medm) > Be atk (nedn) 65 Hone. at = at® (rmedm) By O aa => ath oy (medm) but is phimitive tot (medm) 4 a 4 (nedm) where (m) is least ve integer 6 ptm) | t-ka > t= Kb (med hom) = Kk: Indb (red $m) (Proved) wv) Sppie t= Indd = 1 at (medm) bat ais primitive Acct (mm) => PO 4 ned mn) there Poor is Least tue integer to gem | = t = 0 (mod $0n)) => Ind.t =0 (mod $0] (Proved) ———E => Indiv Scanned with CamScanner Birorial conquers A. Congauence ef the form ax = b (mdm) is Called Binomial Conuuence. fA is punitive pact (ned) then qed (Asm)=4 ond AX" =b (modm) 1s equivalent to Ind ain Ind,% = Ind,b (ied $(m)] Whidh can be Solved easily being linear Gomeruence we Question Solve Tr? = 2 (meal) Sutin G(r) =10 We fastly ind phimitive Acot (med I!) =2 (medi) Cleaty 2 is paimitive oot (med 11) Pet (medi) Os = P=e (modi) als 5 (mdi) ius Palo (meal) oytl2]2]*15]617/8 [2/0] ong qa Hina bf 10 | £ a s| al27 (maw) =I ats 3 (mall) Gonsidtr Tx? = 3 (med!) a= 6 (modll) > Ind,7 +3 Ind, = Ind,3 {mod ] 221 (medi) > 7 +3Ind, x= 8 [mod $y] > ZB Ind X= 1 (med 10) = Plu)e 0 2S Ind, xX S-F (med) > In X= 3 (edhe) > Thx = 7 (medio) 09 > X= 7 (Modi) id SSP ot which is Aequited Selution. ‘eon eel Scanned with CamScanner 2b ® Question Sve SX? =A (med 13) pe hl > G(I3) 12 hal J i and phimitive Acot (med 13) + 2! 2 (mdi3) Fiastly we fm pain oot a ae Clearly 2 ts primitive Amt (mod '3) 44 2 = frdny 228 (med 3) b [tl2/3le[slél7[elafele [2 a: (et3) mbfe fale tele fs] [s[elel ze] 22% om 2 1. a's 12 (mdi3) Consider Sx? = 1 (med 13) (neds) = TndyS4+3 Ind, x = Ind A [med 19) a%=9 (maid) > 4 +3 Ind, x= 12 (medi2) 2525 (ned 3) = 3 Ind X= 3° (wd la) = 10 (med13) gea(anya3 | 3 a"=7 (moll3) So given Conganence has 3 Soltis. a= 4 (moda) = Thnx = 4 (med4 ) Thus Slutins ave Pn Ind x = 1,5,9 (omed 12) Ind, x = 1 (medi2) > XS 2 (mAi3) (Vlas 5,8 (med3) are Silatins. ——— Question: Sle 3x = 2 (mod) Ind, X = 5 (medn)| Ind, X 9 (med) > X=E6 (med) | X= S (ymedlz) Sl + Pln)=lo Ze Firstly, we find penile Ao0t (mid!) ce wm Cleasly a is primitive Awot (ted I!) ee b a[2z] 3] «| s[ ¢ 7] + 3}% cate TL at et eT 7[ 3] «<[s Gsider 3x" = Gnedit) > Ind +4 Tnd,x = Ind, 2 (med $0] Scanned with CamScanner > 844 Indxet (ened) > 4Ind x= -7 (medt0) > 4 Ind, % = 3 (medio) ged to) = af 3 > Grven Cngaueme has 10 Luton. —*—~—E-K&—F—e—E—— Exponential Gnngpuence: 4 Gngausme of he form a. = Cc (medm) is called Exponeatia) Grginence Ts Tk can also be Salved by The Treory f indices. Soci nm Question: Solve iy 4% = 13 (med IF) iy) 5.G%=7 (modi) Solution i) Consider 2 $UiT)2I6 and 3 is prin Five GM 213 (meal?) oe : ! a = 4 (med 17) ee (et) ee 3 > af soto (melt), 34SI3 (mod IF) a ae ow BES (md, sais (mall x = : a G Blan (madi, 38216 (med 17) * ged liane) = Is tet (yd?) , 3! (med 17) => Grgnuauce hos 4 ee a Solutions 3laz (dl), PG (rll Lax (modi) > 3x51 Qrnedu) 3212 (moll7), Bea (mod 3) > 3x2-3 (medi) BSE (mated, 31 (mad 2) DB LEHI (modu) => x23 (medi) Shs Solutions are x= 3,7,11, 15 (aedlb) — Scanned with CamScanner ® id Congidey + Pls 10 wd Q is phimitive At 5.4% = 7 (modi) fou st > Tad +x Indy 3 Io? [mal Py] alsa (mein), a= dU) aoe (med), ats (med) 2 ax SB (medio) Fete (med , abs a (man) 727 (medi) , S823 (edt) Cleaaly ace (2,0) =ap 3 SS fred), am | (med) > 442(8) S 7 (med I) Heme Griven Gyytuemne had mv Shuition ee Assuenent Exencisé, GL i Cateatte all privtive svcts Font 18,19, 23,26, jiy Find all primitive Acots fos sty’, 53 i) Fis on cad pime “p’ Shs Hat p” and Bp” for 7%! imitive hooks have Same mamber 4 in Obtain all pomitive hotls of 4] and BR- QE iy Cabestote the orders of 2,3,5,7,4 (ont), (tod 13) ( med 4), iy Show that ©) If-ar has ordey hk (med) thm MP Wag order K (med m) . »)Tf7a" has onder ak med odd prime” p° thom a= —1 (onedp), eI has orderin-” (qd m) Mam on vs time: QZ Sie te following Congauemced 4 od 27 (med 13) iy x8 = 0 (modi!) — iv) xi? 13 (med I?) vip x? = S (med 13) Bates Gredi) Ix3 = 2 (mmda3) v) vip THB (med) vit) TS 7 (med?) ») (mod!) x) 3 (edt) —— Scanned with CamScanner Non-Linear Diopan tine Equations: No-Lnene Snr We huve already disassed about Linear Diophantine equation art by =e Nu we discacs Some tnon-linear Diophantine equations: Pemie de Fermat discussed non-linear Diophartine Eauation of We form x” +oa2" fer nye. as uellas x” ay ae” fr mn7z2 chew men Let us start our discussion by Hes e Pythagorean Thiples:- A Pythe gotean Thiple is a set of three integers YF suchthat wry ae The thiple (x4 2) is called plimitive f acd Qyya=at. 4 (49), (S.12,13), C815, feat ¢ oe o( ) BIS 17) ave pain hive Pythagorean also 810), ('2,3%, ab) | (16,3034) ave. Pathan g orean tHiples but not primitive os ged (4,810) = Ged (8 3426)= geg (430.1).5 Remarks: 4) Let %4,2 be Pythagorean tiple and A= ged (4,42) w toetgeaapee Nae! => dA(%@4y2) = AZo routed L AHMOOD > It Bs Be a a ceuge Rann ane Hens (%,'bZo) is paioitive Faog erean Tuple. Scanned with CamScanner @ 2) Tf (x,y,2) is Pyflagorean Thiple Then (£2, 44, +2) wih all possible Gmbinehons of Sign is also Fy frag orean Tiphe. Lemma:- If 4,2 is a paimitive lythagorean tuple hen one af x on is even, while offer is Odd: Pref Suppate on Cinttery that bolk % and y are even then ala ond 2/y > al erg > alz 2 alz which implies hat ged (ay2)% ® hich is imprssible as (%y42) is phim i, Ff beth x and y are Odd them X=) (omedt) and =I (ted 4) > Be xf = 2 (md) which is impsBible as 2 is evem being Sum of fare odd integers Square which Should be Gngsuent te 0 or Y (20d) has Conseguurtly one of x andor y Should be even anol oher Should be Odel to podus (%, 42) a phmitioe Py the yoeen Taiple- Remark :- If ab=c” whe geal (4,b)=4 Mon fhere exist pat'tive iabggers a, 5b, buch hat azar and bob His quite obvious by Fiandarental Theorem of Aaithemedes Scanned with CamScanner Tusoren, —( Feamats Last Meorem far_7=2) AN positive primitive Solutions of xy gre Sup hat lx are gion y asast , yo ste’, zo st” alae S>tro ond ged(t=t amd Spt (med2), Proof. Let (%,%,,2,) be ave paimitive Slaton of x = 2 tu that lx them 44922 where ged (%), ¥,,2))=4 > ged (My )= ged (H2=gel(X,,2,)= 1. We have the filling Cates i) Hf % and y, are both are even Ton te 94% I 2) 22 and even alich impotiible as ged (My 2,)= 4 ii) Now aa poaibilly Ahise that x= Even and y= Odd=2, * alx 4 aly, > 4= 8a Meg Ps 8) 9? =(2 +H) 1-H) 25d are odd 0 2+ = Odd todd = Even = BU 2,-j, = odd—Odd = Even = av + ge hee > ged (uv) =4 Now tp + Wee, fe a ° 2-9 =@ ta )(2,-y) > (2a)= (84) (av) > bars guy or Dauy fr ue Z* for veo? Scanned with CamScanner @ ged (UVa and = ou 2 Us s* vet™ for Stent west oy anst + Stee Hene x, = 2a > ast z+ = ou aud 2,-y = av Adding => QB, = Qluty) ably aay, = 2(U-v) Z)= ur geuy Z,= St” gee see (ees all tHe Phimitive butions ace aye m= ast, yo St B= Sot” fir sted. Question: Find five primitive poitive actions of ay ge 2 Slaton: We now at All 4ve prion tive Llutind of n+ o =z are of he fom xe ast 5 fe SUL | Be S4t” for S>tre d ews ez [ os t_[xzast_[y-sue* laws] (yz) 4 4 3 S | (3s) 3 2 12 Ss 1p (1a,5)13) 4 1 8 1S) 1p | (8S 1%) 4 : au 7 as | (au,#,aS) — 2 320 | al ad | (a2,a1,24) Ss 4 40 9 4 | (40,9,41) ll Scanned with CamScanner Fos: Every lato of Cage” is of the form a= a(@Stld , ge #(sit)d, z= t(setld whe d= 94 (% 42): Proof Given hat gel (mipa)= al whe (% 7,2) Is Slatin f aa =z? adx , a/y , az > xdx , gan , Betd2, hare sea > Gf, 52) =I aud a yrs =2> > eda)"+ Gay)” = dz) od (re) = aap 2 typ = Be Hence (41% ,21) is panto taiple ond Aalution ft pe east, Yo seth, Be Crete i for ged Gta 4 b7tro Hence Hence x= +(ast)d , go2(St)d, z=4(s4t)d is abso deletion of ay ya Bt. Letellagy Ff (Berth, 2e) is fhe Salation of t4y7=2* en (Kes Kite, Ks) is alto Solution off if for KER. Pref let Z=Kx , J=Kf, » 2=KZo Guid “eye (Cx) (Kfo)™ = KK. ak? (x+y) Scanned with CamScanner ® a degra k(ad) tHe Bas > Sty = (Ke) (a Bis dilution of I X ty "= 2 7 Xt =2> Hen (Kr, k4,, KB) ig delutin of rg ae Question Obtain all 4ve pAimitive tuple fr ery 22? whim %= 60 * +e phinitve tiple which are delutions of r+ y= 2* of he’ farm He ast , ge St, Be S yt? ft ged(Stal , S>tro and S#t (md2) Given at = x= bo Solu’ an = Ast =bo => St =30 which imphes BI aes 30 = 1X30 = AxIS= Bxle= SKE 6h = 30175899 > Ze 304% Jol S28, 4225 Yois-deaal » Belay 3224 Soto, 42 3=> ye worse 4) , B= l043~= [09 S26 t2S> go bistan , B= 64S*= oF Shas 40e LyPhagerean Triples when x= 60 are (60, 1,61) , (6, 95/04) , (0,aal,aa4), (60, 899, 90!) tea. Guest: el Pythagorean Thiples white terms are in AP, Sdaon. Sipe (HN, X, X4n) be Lphegorean Thiple in AP. > 2'+ (a-n)*= (xpn)* for EN > HEP WEN ANK = EN BX > gt ann = anx aS Lax =0 Scanned with CamScanner > 2x(x+n)=0 @ => =o or x- Un=zo => x*=0 oy x=4n X#O0 a x repress bile of pst tring h Hera X= 4n : Thus tome (nena an sasitelernoop XIN = Yntn = Sn Se ours ‘Cow college Rab Hen Pythagorean Triple whose terms are in AP. Ce (3n,4n, Sn) fr neN. TiesREm. Te Diophandne Equation ateyts 2° has m0 + tinlegrad talution for, 4,2. Pref Suppose on Confrang Mat (0, tp, 24) be olution fate gta at in inkgers Suppose ged (raj, 22)= 4, Ohorwne f ged (24 j,2,)= thin ged (m= Fa ge he &228)=) Ms Ie + ft = Be O8)"4(H) = (B)* alee Ged (0, i 2.)=I 44 ged (H,4,2,) = | Hence — (Ie, fe’, Be) fe te fy a eae Tip oe See Ura Ast , Gr=S-t', R= Set _ FF (st)=1 S#t (med2) Tus exactly one of St 18 even and olbey 1s Odd “y & 15 even hin ea Even— Odd? = Odd* B S ; Cts Legh (add) ee Lan odd in foe Sam bi Scanned with CamScanner ® -1 (rel) As Stotmn, ts 0ad™ =! Gad) 2 Ss ofmeds), ts! Cred) => 123 (met) which imprtiible to $ ia mt even > te een g% tah a Ul %2= ASt = 25(AL) = 4SA /o 2 se (BP + ged (S4)=1 9 ged (SAI and &= Square to Sand b Sold alto be Square > S= zp » ba a prawet da Sit > Se Het? which 1 by ha gorean Equation heme ged (St)=) A ged (S4 yg Je) > 45) us primitive re Pyfhegorcan Tnple * t= aw gez wove S= uy? fe ur V>0 gad (uy)=) te aw ve £ ah 2 ee a a => wre uw and ged (u,v) =! DWV Should be Sagres Fa ond) VEY) for myez e Sz Ur4v™ becames Be OPI 4 (92) > af rgteay where 21 and t are positive uch that 042,527 =Sés*c Set a2, Staating frm (Ke, Go 12) os Bolution t xh 4oge we have Constructed anolhey Balaton (1,4, 2)) tach that Scanned with CamScanner a . | 8 Repeating he hele agguenent, we obtain anolhey Soletan (%,d., 22) tach Mat 04%, <2, <2, 042,42 (hes pret tan be extended by many « times as debire to gt a Beyunce 4 Aolutens Auch ted O < + Bz, <2, <2. but Bere ave o “in'fe number f ea tive integers z LA Thon Zo. Tis Gntadicts te Aagpettin Mat tay! = 2 has telethon Hema thgta® has mo integral deibrn. Corollary - The equation x's. ge 2! has m0 Silution in the Positive integers. Solution. Let (20, a, 20) be Sulution of Urytae" then (0, %,,22) would bobisfy xy te at which Comtradiets Uhat a ae 2 has v0 Solution in tategers (4-06 integers) ea agent hod ne Solution, Fexmat Last Treorem:. eggs” The equation “ueatis ee x44? = 2B” aes hes Sdstiom in +ve integers (n =2~ but has m0 dilation in 4ve integers f oo THE END. Scanned with CamScanner

You might also like