mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-14 18:03:53 +08:00
e112434dee
* Add prettier config * test: add test to check for absolute function * chore: es5 to es6 * test: add test to check mean function * test: add test for sum of digit * test: add test for factorial * test: add test for fibonnaci * test: add test for find HCF * test: add test for lcm * test: add gridget test * test: add test for mean square error * test: add test for modular binary exponentiation * test: add tests for palindrome * test: add test for pascals triangle * test: add tests for polynomial * test: add tests for prime check * test: add tests for reverse polish notation * test: add tests for sieve of eratosthenes * test: add tests for pi estimation monte carlo method * chore: move tests to test folder * chore: fix standardjs errors
44 lines
939 B
JavaScript
44 lines
939 B
JavaScript
/*
|
|
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.
|
|
const findLcm = (num1, num2) => {
|
|
// If the input numbers are less than 1 return an error message.
|
|
if (num1 < 1 || num2 < 1) {
|
|
return 'Please enter values greater than zero.'
|
|
}
|
|
|
|
// If the input numbers are not integers return an error message.
|
|
if (num1 !== Math.round(num1) || num2 !== Math.round(num2)) {
|
|
return 'Please enter whole numbers.'
|
|
}
|
|
|
|
let maxNum
|
|
let 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
|
|
}
|
|
|
|
export { findLcm }
|