Algorithmic Note _042: Seeking least common multiple (Java)

Directory

1 Problem Description

2 Solutions

  1 problem description

What is least common multiple? the smallest integer that can be divisible by both the number M and the number n . For example, The least common multiple is equal to. Below, write the relevant function implementation to get The least common multiple of the numbers m and N.

2 Solutions

The idea of solving least common multiple in this paper comes from the third edition of the Basic algorithm design and analysis, which is as follows:

The specific code is as follows:

 PackageCom.liuzhen.chapter6; Public classLeastcommonmultiple {//solving number m and N greatest common divisor using Euclidean algorithm     Public intGETGCD (intMintN) {         while(N > 0){            inttemp = m%N; M=N; N=temp; }        returnm; }        //solving numbers m and N and least common multiple     Public intGETLCM (intMintN) {        intGCD =GETGCD (m,n); intresult = M*n/GCD; returnresult; }         Public Static voidMain (string[] args) {leastcommonmultiple test=Newleastcommonmultiple (); System.out.println ("Greatest common divisor of 60 and 16:" +TEST.GETGCD (60, 12)); System.out.println ("Least common multiple of 60 and 16:" +TEST.GETLCM (60, 12)); }    }

Operation Result:

Greatest common divisor of 60 and 16:least common multiple of 60 and 16:60

Algorithmic Note _042: Seeking least common multiple (Java)