Find the LCM and HCF using Recursion

HCM_LCM_Recursion.java

/*
Program to Find the LCM and HCF using Recursion
*/

import java.util.Scanner;

class HCM_LCM_Recursion {

    int common = 0;

    int calculateLCM(int a, int b) {
        common += b;

        if (common % a == 0)
            return common;

        else
            return calculateLCM(a, b);
    }

    int calculateHCF(int a, int b) {
        if (b == 0)
            return a;
        return calculateHCF(b, a % b);
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the first number");
        int a = sc.nextInt();
        System.out.println("Enter the second number");
        int b = sc.nextInt();
        System.out.println("LCM is: " + new HCM_LCM_Recursion().calculateLCM(a, b));
        System.out.println("HCF is: " + new HCM_LCM_Recursion().calculateHCF(a, b));
    }
}