Greatest Common Divisor: The flowchart in Fig. 3.29 finds the greatest common divisor (GCD) of two nonzero integers input by the user. Note: The GCD of two numbers is the largest integer that divides both. See Fig. 3.27.

Enter value of M: 30

Enter value of N: 35 Enter a positive integer (>1): 2345

Greatest common divisor: 5 Prime factors are 5 7 67