Lowest Common Multiple

LowestCommonMultiple.java

public class LowestCommonMultiple
{
  public static void main(String[] args)
  {
    FindMultiple();
  }
  
   static long FindLcm(long a,long b){
       long lcm,hcf = 0;
       long i=1;
       long ger=a>b?a:b;
       while(i<ger)
       {
           if((a%i==0) && (b%i==0))
               hcf=i;
           i++;
       }
       lcm=(a*b)/hcf;
       return lcm;
   }
  
  //Euclidean algorithm
  static long gcd(long a, long b) {
    while(b > 0) {
        a %= b;
        if (a == 0) return b;
        b %= a;
    }
    return a;
  }
  
 static void FindMultiple(){
     long lcm=1;
     for(long i=2;i<=20;i++)
     {
         System.out.println("Lcm="+lcm + " i: " + i);
         //lcm=FindLcm(lcm,i);
         lcm *= i/gcd(lcm,i); 
         System.out.println("result Lcm="+lcm + " i: " + i);
     }   
     System.out.println("Lcm="+lcm);
 }
}

/*output:

Lcm=1 i: 2
result Lcm=2 i: 2
Lcm=2 i: 3
result Lcm=6 i: 3
Lcm=6 i: 4
result Lcm=12 i: 4
Lcm=12 i: 5
result Lcm=60 i: 5
Lcm=60 i: 6
result Lcm=60 i: 6
Lcm=60 i: 7
result Lcm=420 i: 7
Lcm=420 i: 8
result Lcm=840 i: 8
Lcm=840 i: 9
result Lcm=2520 i: 9
Lcm=2520 i: 10
result Lcm=2520 i: 10
Lcm=2520 i: 11
result Lcm=27720 i: 11
Lcm=27720 i: 12
result Lcm=27720 i: 12
Lcm=27720 i: 13
result Lcm=360360 i: 13
Lcm=360360 i: 14
result Lcm=360360 i: 14
Lcm=360360 i: 15
result Lcm=360360 i: 15
Lcm=360360 i: 16
result Lcm=720720 i: 16
Lcm=720720 i: 17
result Lcm=12252240 i: 17
Lcm=12252240 i: 18
result Lcm=12252240 i: 18
Lcm=12252240 i: 19
result Lcm=232792560 i: 19
Lcm=232792560 i: 20
result Lcm=232792560 i: 20
Lcm=232792560

*/