Problem Definition [Step 0]

Given two positive integers a and b, the GCD is the largest number that divides both evenly. (For simplicity, we'll assume tex2html_wrap_inline285 .)

Examples:

Your turn: compute GCD(85,68)?


next up previous
Next: Modulus Up: GREATEST COMMON DIVISOR Previous: GREATEST COMMON DIVISOR