# Are the Two Numbers 1,190 and 3,782 Coprime (Relatively Prime, Prime to Each Other)? Check if Their Greatest Common Factor, GCF, Is Equal to 1

## Are the numbers 1,190 and 3,782 coprime (prime to each other, relatively prime)?

### 1,190 and 3,782 are not relatively prime... if:

#### If there is at least one number other than 1 that evenly divides the two numbers (without a remainder). Or...

#### Or, in other words, if their greatest (highest) common factor (divisor), gcf (hcf, gcd), is not equal to 1.

## Calculate the greatest (highest) common factor (divisor),

gcf (hcf, gcd), of the two numbers

### Method 1. The prime factorization:

#### The prime factorization of a number: finding the prime numbers that multiply together to make that number.

#### 1,190 = 2 × 5 × 7 × 17

1,190 is not a prime number, is a composite one.

#### 3,782 = 2 × 31 × 61

3,782 is not a prime number, is a composite one.

#### Prime number: a number that is divisible (dividing evenly) only by 1 and itself. A prime number has only two factors: 1 and itself.

#### Composite number: a natural number that has at least one other factor than 1 and itself.

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

#### Multiply all the common prime factors of the two numbers, taken by their smallest exponents (powers).

### gcf (hcf, gcd) (1,190; 3,782) = 2 ≠ 1

## Coprime numbers (prime to each other, relatively prime) (1,190; 3,782)? No.

The two numbers have common prime factors.

gcf (hcf, gcd) (1,190; 3,782) = 2 ≠ 1

Scroll down for the 2nd method...

### Method 2. The Euclidean Algorithm:

#### This algorithm involves the process of dividing numbers and calculating the remainders.

#### 'a' and 'b' are the two natural numbers, 'a' >= 'b'.

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

#### If 'r' = 0, STOP. 'b' = the gcf (hcf, gcd) of 'a' and 'b'.

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

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

3,782 ÷ 1,190 = 3 + 212

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

1,190 ÷ 212 = 5 + 130

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

212 ÷ 130 = 1 + 82

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

130 ÷ 82 = 1 + 48

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

82 ÷ 48 = 1 + 34

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

48 ÷ 34 = 1 + 14

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

34 ÷ 14 = 2 + 6

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

14 ÷ 6 = 2 + 2

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

6 ÷ 2 = 3 + 0

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

2 is the number we were looking for - the last non-zero remainder.

This is the greatest (highest) common factor (divisor).

### gcf (hcf, gcd) (1,190; 3,782) = 2 ≠ 1

## Coprime numbers (prime to each other, relatively prime) (1,190; 3,782)? No.

gcf (hcf, gcd) (1,190; 3,782) = 2 ≠ 1

## Other similar operations with coprime numbers:

## Are the two numbers coprime (relatively prime)?

#### Two natural numbers are coprime (relatively prime, prime to each other) - if there is no number that is evenly dividing both numbers (= without a remainder), that is, if their greatest (highest) common factor (divisor), gcf, or hcf, or gcd is 1.

#### Two natural numbers are not relatively prime - if there is at least one number that evenly divides the two numbers, that is, if their greatest common factor, gcf, is not 1.