### 7,562 and 5,240 are not coprime (relatively, mutually prime) if they have common prime factors, that is, if their greatest (highest) common factor (divisor), gcf, hcf, gcd, is not 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.

#### 7,562 = 2 × 19 × 199;

7,562 is not a prime, is a composite number;

#### 5,240 = 2^{3} × 5 × 131;

5,240 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).

#### gcf, hcf, gcd (7,562; 5,240) = 2;

## Coprime numbers (relatively prime) (7,562; 5,240)? No.

The numbers have common prime factors.

gcf, hcf, gcd (5,240; 7,562) = 2.

### 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:

7,562 ÷ 5,240 = 1 + 2,322;

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

5,240 ÷ 2,322 = 2 + 596;

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

2,322 ÷ 596 = 3 + 534;

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

596 ÷ 534 = 1 + 62;

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

534 ÷ 62 = 8 + 38;

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

62 ÷ 38 = 1 + 24;

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

38 ÷ 24 = 1 + 14;

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

24 ÷ 14 = 1 + 10;

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

14 ÷ 10 = 1 + 4;

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

10 ÷ 4 = 2 + 2;

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

4 ÷ 2 = 2 + 0;

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

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

This is the greatest common factor (divisor).

#### gcf, hcf, gcd (7,562; 5,240) = 2;

## Coprime numbers (relatively prime) (7,562; 5,240)? No.

gcf, hcf, gcd (5,240; 7,562) = 2.