Paano kuhain ang Greatest Common Divisor (GCD)/Greatest Common Factot(GCF) ng malalaking number? (Brief explanation)
May tinatawag tayong Euclidean Algorithm or Continous division, try muna natin sa maliit, halimbawa, ahhhm.. what is the GCD of 44 and 20 ?
Pwede rin siya isulat na ( 44 , 20 ) = gcd
Laging mauuna yung malaki bes ah?
So para kunin gcd, ganto itsura,
44 = 20
*ilang 20 yung nasa 44? 2 diba? So,
44 = 20(2) *ilan ang kulang? 4 diba? So,
44 = 20(2) + 4 *parehas na sila 44, yung 20 naman gamitin natin at yung 4 so,
20 = 4 *ilan yung 4 sa 20? 5 diba? So,
20 = 4(5) *ilan kulang? 0 diba? So,
20 = 4(5) + 0 *Pag 0 na, tapos na paghihirap mo, kasi nasa taas yung gcd which is 4.
( 44 , 20) = 4.
Isa pa, what is the gcd of 469 and 1704?
Ganto itsura (1704,469)=gcd
1704 = 469(3) + 297
469 = 297(1) + 127
297 = 127(2) + 43
127 = 43(2) + 41
43 = 41(1) + 2
41 = 2(20) + 1
2 = 1(2) + 0
So the gcd is 1, (1704,469)=1
Isa pa, mabait ako e :) What is the gcd of 1222 and 842? So (1222,842)=gcd.
1222 = 842(1) + 380
842 = 380(2) + 82
380 = 82(4) + 52
82 = 52(1) + 30
52 = 30(1) + 22
30 = 22(1) + 8
22 = 8(2) + 6
8 = 6(1) + 2
6 = 2(3) + 0
So yung gcd ay 2,
*para sa checking, dapat divisible yung gcd sa dalawang numbers.
Haba ba ng process? Nagtataka kayo bat naka ordered pair yung dalawang number? Gagamitin kase natin si x and y sa next na topic dito, yun ang "extende Euclidiean algorithm". Eto lang muna.
Try this:
What is the gcd of:
1. 258 and 322
2. 746 and 1000
3. 462 and 180
#MMBLTUTORIAL
-luyde
