Euclid's Algorithm is a fast way to get the greatest common factor: http://en.wikipedia.org/wiki/Euclidean_algorithm. You can also use prime factors, but that is slower, especially for large numbers.
For the least common multiple, use the fact that the least common multiple, multiplied by the greatest common factor, is equal to the product of the two numbers. In other words, since (by Euclid's Algorithm) the greatest common factor of 20 and 30 is 10, you calculate 20 x 30 / 10, to get the least common multiple, which in this case is 60.
hcf is 1 and LCM is 35
HCF is 48 and LCM is 576
hcf = 42, lcm = 84.
The HCF is: 2The LCM is: 2,520
hcf: 1 lcm: 112,038
it means lowest common multiple. the opposite to it is hcf or highest common factor ^_^
LCM is 20 and the hcf is 10
It's kind of an inverse relationship. The product of the GCF and LCM of two numbers is the same as the product of the original two numbers, so as the GCF increases, the LCM decreases and vice versa. LCM is divisable by HCF.
HCF = 3... LCM = 18 !
HCF is 60 and the LCM is 360
hcf is 1 and LCM is 35
HCF is 48 and LCM is 576
hcf = 42, lcm = 84.
The HCF is: 2The LCM is: 2,520
The HCF is always a factor of the LCM of two numbers. The HCF is a factor of both the numbers which are factors of their LCM. Thus the HCF is also a factor of the LCM of the two numbers.
hcf: 1 lcm: 112,038
No. The LCM MUST be a multiple of the HCF.