# Question #b75c8

##### 3 Answers

Both depend on factors of the numbers.

#### Explanation:

The GCF is the greatest common factor. To find the GCF factor all the numbers and look for the largest factor than is the same for all the numbers.

The LCM is the smallest common multiple of all the numbers. To find the LCM factor all the numbers. Then multiply all the unique factors. If there is a 2 in four of the numbers the 2 only needs to be used once in finding the Least Common Multiple not four times.

Solving for both the GCF and LCM depend on finding the factors of all the numbers involved. This is one way the GCF and LCM are similar.

G C F is the greatest common factor or greatest common divisor which will contain only the common factors that are found between 2 or more terms.

L C M is the least common multiple and is the least number which is divisible by 2 or more terms.

#### Explanation:

G C F is the greatest common factor or greatest common divisor which will contain only the common factors that found between 2 or more terms.

L C M is the least common multiple and is the least number which is divisible by 2 or more terms.

Eg:

Taking two numbers 12, 18

Factors for

Factors for

G C F :

Factors for 12 =

Factors for 18 =

L C M :

Factors for 12 =

Factors for 18 =

L C M =

It is easy to define, when expressing numbers by prime factorization with powers.

#### Explanation:

Let's first see divisibility relation in this way:

144 is divisible by 12 because **all** exponents in factorization of 144 are **greater than or equal to** corresponding exponents of 12.

GCD and LCM are mostly applied to pairs of numbers, but work as well for 3 or more.

This means that each of these 3 numbers is divisible by

Exponents of **less than or equal to** exponents of 84, 120 and 144. At the same time **greatest** possible, so:

This means that **greater than or equal to** exponents of 84, 120 and 144. At the same time **least** possible, so:

The exponents 0 and 1 can be omitted while writing for comfort, but must be considered, when comparing numbers (up to largest prime with nonzero exponent).

Summing up, GCD is found by taking