How to resolve the algorithm Least common multiple step by step in the TypeScript programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Least common multiple step by step in the TypeScript programming language
Table of Contents
Problem Statement
Compute the least common multiple (LCM) of two integers. Given m and n, the least common multiple is the smallest positive integer that has both m and n as factors.
The least common multiple of 12 and 18 is 36, because:
As a special case, if either m or n is zero, then the least common multiple is zero.
One way to calculate the least common multiple is to iterate all the multiples of m, until you find one that is also a multiple of n. If you already have gcd for greatest common divisor, then this formula calculates lcm.
One can also find lcm by merging the prime decompositions of both m and n.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Least common multiple step by step in the TypeScript programming language
Source code in the typescript programming language
// Least common multiple
function gcd(m: number, n: number): number {
var tmp: number;
while (m != 0) {
tmp = m;
m = n % m;
n = tmp;
}
return n;
}
function lcm(m: number, n: number): number {
return Math.floor(m / gcd(m, n)) * n;
}
console.log(`LCM(35, 21) = ${lcm(35, 21)}`);
You may also check:How to resolve the algorithm Ackermann function step by step in the Ioke programming language
You may also check:How to resolve the algorithm Arbitrary-precision integers (included) step by step in the SPL programming language
You may also check:How to resolve the algorithm Sleep step by step in the X86 Assembly programming language
You may also check:How to resolve the algorithm Generator/Exponential step by step in the D programming language
You may also check:How to resolve the algorithm Sorting algorithms/Sleep sort step by step in the PHP programming language