Question

2. Discrete Math. Write a java program that implements euclidean algorithm to calculate gcd of any two numbers.

Answer 1

import java.util.Scanner;
public class GCD1 {
    public static void main(String args[]) {
        int m, n, gcd = 1;
        Scanner in = new Scanner(System.in);
        System.out.print("Enter value for m: ");
        m = in.nextInt();
        System.out.print("Enter value for n: ");
        n = in.nextInt();

        for(int i = 1; i <= m && i <= n; ++i) {
            if(m%i==0 && n%i==0)
                gcd = i;
        }
        System.out.println("GCD = "+gcd);
    }
}