**Definition:** **the Greatest common divisor of** two or more natural numbers is called the greatest natural number that divides each of the given numbers.

For example

NOD

## Coprime numbers

**Definition:** Two natural numbers are called relatively Primeif their GCD is equal to one.

## Finding GCD using the decomposition into Prime factors

### To find the GCD of two or more numbers, you must:

- To put these numbers into
**Prime factors**. - To make the product of the common Prime factors taken with the smallest exponent.
- To find the value of the work.

### The Euclidean Algorithm

- Share on with Stacey:
- Divide the divisor into :
- Divide the divisor into the new balance :

The last nonzero remainder is the GCD.

## Least common multiple (LCM)

**The least common multiple of** two or more natural numbers is called the smallest natural number that is divisible by each of the given numbers.

## Finding knock two natural numbers

### To find the NOC two or more numbers, you must:

HCK

For example

NSK

## The connection between the NODE and the NOC of the two numbers

NOD