mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2026-03-13 15:21:15 +08:00
Javascript/Math: editing file name
This commit is contained in:
38
Maths/FindLcm.js
Normal file
38
Maths/FindLcm.js
Normal file
@@ -0,0 +1,38 @@
|
||||
/*
|
||||
author: PatOnTheBack
|
||||
license: GPL-3.0 or later
|
||||
|
||||
Modified from:
|
||||
https://github.com/TheAlgorithms/Python/blob/master/maths/findLcm.py
|
||||
|
||||
More about LCM:
|
||||
https://en.wikipedia.org/wiki/Least_common_multiple
|
||||
*/
|
||||
|
||||
'use strict'
|
||||
|
||||
// Find the LCM of two numbers.
|
||||
function findLcm (num1, num2) {
|
||||
var maxNum
|
||||
var lcm
|
||||
// Check to see whether num1 or num2 is larger.
|
||||
if (num1 > num2) {
|
||||
maxNum = num1
|
||||
} else {
|
||||
maxNum = num2
|
||||
}
|
||||
lcm = maxNum
|
||||
|
||||
while (true) {
|
||||
if ((lcm % num1 === 0) && (lcm % num2 === 0)) {
|
||||
break
|
||||
}
|
||||
lcm += maxNum
|
||||
}
|
||||
return lcm
|
||||
}
|
||||
|
||||
// Run `findLcm` Function
|
||||
var num1 = 12
|
||||
var num2 = 76
|
||||
console.log(findLcm(num1, num2))
|
||||
Reference in New Issue
Block a user