### 5,065 and 2,929 are coprime (relatively, mutually prime) if they have no common prime factors, that is, if their greatest (highest) common factor (divisor), gcf, hcf, gcd, is 1.

## Calculate the greatest (highest) common factor (divisor), gcf, hcf, gcd

### Approach 1. Integer numbers prime factorization:

#### Prime Factorization of a number: finding the prime numbers that multiply together to make that number.

#### 5,065 = 5 × 1,013;

5,065 is not a prime, is a composite number;

#### 2,929 = 29 × 101;

2,929 is not a prime, is a composite number;

#### Positive integers that are only dividing by themselves and 1 are called prime numbers. A prime number has only two factors: 1 and itself.

#### A composite number is a positive integer that has at least one factor (divisor) other than 1 and itself.

### Calculate greatest (highest) common factor (divisor):

#### Multiply all the common prime factors, by the lowest exponents (if any).

#### But the two numbers have no common prime factors.

#### gcf, hcf, gcd (5,065; 2,929) = 1;

coprime numbers (relatively prime)

## Coprime numbers (relatively prime) (5,065; 2,929)? Yes.

Numbers have no common prime factors.

gcf, hcf, gcd (2,929; 5,065) = 1.

### Approach 2. Euclid's algorithm:

#### This algorithm involves the operation of dividing and calculating remainders.

#### 'a' and 'b' are the two positive integers, 'a' >= 'b'.

#### Divide 'a' by 'b' and get the remainder, 'r'.

#### If 'r' = 0, STOP. 'b' = the GCF (HCF, GCD) of 'a' and 'b'.

#### Else: Replace ('a' by 'b') & ('b' by 'r'). Return to the division step above.

#### Step 1. Divide the larger number by the smaller one:

5,065 ÷ 2,929 = 1 + 2,136;

Step 2. Divide the smaller number by the above operation's remainder:

2,929 ÷ 2,136 = 1 + 793;

Step 3. Divide the remainder from the step 1 by the remainder from the step 2:

2,136 ÷ 793 = 2 + 550;

Step 4. Divide the remainder from the step 2 by the remainder from the step 3:

793 ÷ 550 = 1 + 243;

Step 5. Divide the remainder from the step 3 by the remainder from the step 4:

550 ÷ 243 = 2 + 64;

Step 6. Divide the remainder from the step 4 by the remainder from the step 5:

243 ÷ 64 = 3 + 51;

Step 7. Divide the remainder from the step 5 by the remainder from the step 6:

64 ÷ 51 = 1 + 13;

Step 8. Divide the remainder from the step 6 by the remainder from the step 7:

51 ÷ 13 = 3 + 12;

Step 9. Divide the remainder from the step 7 by the remainder from the step 8:

13 ÷ 12 = 1 + 1;

Step 10. Divide the remainder from the step 8 by the remainder from the step 9:

12 ÷ 1 = 12 + 0;

At this step, the remainder is zero, so we stop:

1 is the number we were looking for, the last remainder that is not zero.

This is the greatest common factor (divisor).

#### gcf, hcf, gcd (5,065; 2,929) = 1;

## Coprime numbers (relatively prime) (5,065; 2,929)? Yes.

gcf, hcf, gcd (2,929; 5,065) = 1.