Theorem 1.2 (Fundamental Theorem of Arithaetic) si of Aritonie) + Every commasie number can be expressed (factorised) as a product of pines, and this factorization is CaBiaRED por from the onder in which the pine factors occa D3 = BKB OF [BKB > Ne tts ey exist @ w= MxF ov onrp ese Sy Ben of is factors. LD Find theF and bcm D Prove fel YE vr voliovd ov crvvabinal CD (oh wy ew wh 0 wnt > @& akbic wl end vals pee ony ewes OQ 4» fenivabing ov non teueinah rg © ua val Coniwue Te ond MN i. of two hark wh nw firey Quad divde bith bets tnd & anh if in Wiest Gwety oll Wrnen divsoy. Subd (eka =) Ex WCF of (24786) Hy IL, So [2 wil dinde beth 24,26 LS Gmimen diner p41 42,43, £4 £ 6412 ay Ak Lom: = gp LGM 8) tue muna a ab KE flew Land bin smaldeot hurbs Livsille by bth a mb Cie mubhiie of 4 wil allko diwsitle by a 9)Mat to fied WEF ond bom t Product of the Gr} Cmmrerfacby wre Fone with Leth rete a ED CS} Soil in the numbers. ane paulo Dike be Lith Product ofthe greatest awrerof cash primetactans ( ° aes ei gh po involved in the numbers. ond LEM ef Ns, N2N3 whine TOM Find Wc nts pede ep xu aide Cx PX Nas Pe he PH IXY Selabion! RCE ? ge oe ip f= (oy = oe ant OWS ¥e ah Niz ie Nie oo tates Bde Pavs oy, w iv BL Find HF an Lm oF pay x Ian meee PL > (H-2)* CKD (A Aaste) Gory = Gest Cb 04) Ge POE Leyton OOH = Qeyrervad) {ete ow? a) = Geta) OOD = GForge — | Lem (aa Fortvoer) Ces) Be Information of various types of problems Find the greatest number that will exactly divide a, b and e ‘Approach to the problem : 6:5 Cind the grudat neh qed will exadty dinde 20, 20 6070 Sd aig Wee op (295,502,328) 2 Spe Find the greatest number thot wil divide x,y and 2 leaving remainders a, b & & renee - Te nuwbe, “WK ke dive lenakee vere “| ‘Approach tothe problem Require munber = HCP fte-a) tv and ae) a) dese wo (1-0) ke buy dinde bat}ind the grentest number Uh wil divide x.y ana 2 Yavin ren Roeceach aa Te hueke, W kee dole Kenke vero] (i deyn wo (Y-a) ke uly dinse tact J Require number = HCE of(x-a)(y-b) and 2-e) Q Find the greatest number that will divide 148, 246 and 626 leaving remainders 4, 6 and ir respectively ate Mt , (ert) Siu Heh eh} (ue-4) ,Mt Tpe-3 Find the greatest number that will divide a, band e leaving the same remainder in each case yb fi Aopen othe rob 4) 8G | De@ Required number SCD Mc aaTE K LEA be tabs and rensindn Ok Yew “faz dark = G-k dy ,-O | \ b= date > -kidy -© Cadet = Ck asp B) (Gb) =a ~) Ah gts btn disde(O-b) leo SCE =i be Cura ae . eo) Use tC) Re Ch) rey & Find the greatest number that will divide ,127 and 175, so as to leave the same = remainder in each case. r -) P -. IFY- 127, na (1 £-S4 Pe eh of Chase), C D4 W ty CF, 4S and /20) ea Find the least number which is exactly divisible by a, b and e. Approach to tho probe Sey Reqired oumber =LCMafa, bande 5 gia Lect (1,200) > Find the least number which when divided by x, y and z leaves Pil telat YX YE the remainders a, b and ‘Approach to the problem Itis always observed that, (LCM of x, y and 2) ~r my 2 Find the least number which when divided by 36, 48 and 64 leaves the remainders — 95, 37 and 53 respectively. panies ee) aul REA,~ 25,37 and 93 respecuvety tty, New = (UCMaL Be, 9R,H) “UH = 76-11 cee ™ *, the least number which w! Find the then divided by a,b and cleaves the same re Find the least number which when divide remainder 3? a ay 3 30 leaving in each case a By Sobks women rusmbs divide by (9,12) 16/0) % Let Celt) = FI by Zpord> 723 a oma at Type i teas Step -1:LOM of, y and 2= 1, Step -2 1) n-digit greatest number remainder =R Sep “Sb Find ta 'U digit rotate ruebt whch when died by 29,2449 a at Ye 7 ees Jeaves bo rewwaivd po Sauls | a 1a pubible oY [20 22 abeo divine , Go Guithrs fence Muhple of bcm 0 ¢ find bopak Udit mule of no a ae (3 [ es ci a ee ae ‘Find then - digit greatest number which when divided by x.y and z leaves remainder “k” in each case. ‘Approach to the problem Step - 1:LOM of x, y and z=LBind then dit greatest number which when divided by x.y and 2 leaves remainder “k” [Approach to the problem Step - 1:LOM of x,y and z=L Step - 2:1) n digit greatest number ( remainder = R Step - 3: Required number = Easy SB Find Are W digit rentar uiede which ren diwded by pu, 24,40 Jrrves vere [8 di We foud frome faces qucetion 94604 18 = UVL7ZQ WA ye vereinden [f dveheandes g3co a fully Lwle, %o vee-3 Frnt ng RB wich when vied byx.yand eave no Fema Approach tthe problem ‘Step -1LCMof's,yand #=1 Step 21) n dig smallest nomber remainder =R Step 9 -Required number = ndigt smallest umber + OR) Civd te § tpt cpablert wawebe which bin divded by 2e, 0, UO Qenves en ve wed nde com (28,2248) SaBe 4b sa ds 128) 1gs00(2 Digeees To, ie oo tyee-t We 10920 ,5 * sano om ner bh be datas eae Fire agg Heeb fowhene npr othe probe Sie fs LCMols yand= 0 L) digit smallest amber Femaser Rogie umber =n digital umber © L-RI¢K 6D Find tee —cliyit speaert pare When dived by ge 10 wo Reavy reWedid 12 ad © Uigit Sabah masher Udidible by Lem dre weird 12 gy gah aad we (28,2045) 2 wow -7 WP wmoh a= “ta. fw fee Rawk role Livsible by al firsk Jo habvval Wants Lom sf frat Jo nakedness _ Rew CD Fi HeF and COM of to Ae (fe + Gls) er Ref oA com opts So Lom btm 3g ack of 90 a ce Thre Number ane Co-Pine tf th teh #1 Cx= S12 coe CoPrme 2 tls Wek At Ho WOR CO) KUCH LMR) SARE tee Be (89) IDS, leave Lom Cage 60 Ce Prsdabyh rates = 2OKBS = Guo Lee humbas ot 10K BD / ANow 10 nae Riapu eee anit ahi