Greatest Common Denominator

1
Greatest Common Denominator
2
Oldest Algorithm

• Lets examine the 2nd problem I gave you
• find the largest number (GCDGreatest Common
  Divisor) which divides evenly into both 80 and
  112?

3
Oldest Algorithm

• Dividing two integers generates two results
• Quotient the amount of times the divisor goes in
  evenly (integer division)
• Remainder is whats left over
• Ex 9/2 has a quotient of 4 and a remainder of 1.

4
Euclids GCD Algorithm

• Step 1q is a/b (quotient)
• Step 2 r is the remainder of a/b
• Step 3 if r is 0 go to step 7
• Step 4 copy b into a

• Step 5 copy r into b
• Step 6 go to step 1
• Step 7 print out b and quit

5
Find the GCD of 112 and 80