-
Notifications
You must be signed in to change notification settings - Fork 0
/
FindLcm.js
36 lines (28 loc) · 871 Bytes
/
FindLcm.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/*
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.'
}
// Get the larger number between the two
const maxNum = Math.max(num1, num2)
let lcm = maxNum
while (true) {
if (lcm % num1 === 0 && lcm % num2 === 0) return lcm
lcm += maxNum
}
}
export { findLcm }