2,691 and 7,364 are coprime (relatively prime) -- if there is no number that evenly divides the both numbers (without a remainder) -- that is -- if their greatest (highest) common factor (divisor), gcf (hcf, gcd), is 1.
Calculate the greatest (highest) common factor (divisor), gcf (hcf, gcd), of the numbers
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
2,691 = 32 × 13 × 23
2,691 is not a prime number, is a composite one.
7,364 = 22 × 7 × 263
7,364 is not a prime number, is a composite one.
The numbers that are only divisible by 1 and themselves are called prime numbers. A prime number has only two factors: 1 and itself.
A composite number is 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).
But the numbers have no common prime factors.
gcf (hcf, gcd) (2,691; 7,364) = 1
Coprime numbers (prime to each other, relatively prime)
Coprime numbers (prime to each other, relatively prime) (2,691; 7,364)? Yes.
The numbers have no common prime factors.
gcf (hcf, gcd) (2,691; 7,364) = 1
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:
7,364 ÷ 2,691 = 2 + 1,982
Step 2. Divide the smaller number by the above operation's remainder:
2,691 ÷ 1,982 = 1 + 709
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,982 ÷ 709 = 2 + 564
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
709 ÷ 564 = 1 + 145
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
564 ÷ 145 = 3 + 129
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
145 ÷ 129 = 1 + 16
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
129 ÷ 16 = 8 + 1
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
16 ÷ 1 = 16 + 0
At this step, the remainder is zero, so we stop:
1 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
gcf (hcf, gcd) (2,691; 7,364) = 1
Coprime numbers (prime to each other, relatively prime) (2,691; 7,364)? Yes.
gcf (hcf, gcd) (2,691; 7,364) = 1