2,907 and 4,331 are coprime (relatively prime)... if:
If there is no number other than 1 that evenly divides (without a remainder) both numbers. Or...
Or, in other words, if their greatest (highest) common factor (divisor), gcf (hcf, gcd), is 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.
2,907 = 32 × 17 × 19
2,907 is not a prime number, is a composite one.
4,331 = 61 × 71
4,331 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).
But the numbers have no common prime factors.
gcf (hcf, gcd) (2,907; 4,331) = 1
Coprime numbers (prime to each other, relatively prime)
Coprime numbers (prime to each other, relatively prime) (2,907; 4,331)? Yes.
The numbers have no common prime factors.
gcf (hcf, gcd) (2,907; 4,331) = 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:
4,331 ÷ 2,907 = 1 + 1,424
Step 2. Divide the smaller number by the above operation's remainder:
2,907 ÷ 1,424 = 2 + 59
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,424 ÷ 59 = 24 + 8
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
59 ÷ 8 = 7 + 3
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
8 ÷ 3 = 2 + 2
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3 ÷ 2 = 1 + 1
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2 ÷ 1 = 2 + 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,907; 4,331) = 1
Coprime numbers (prime to each other, relatively prime) (2,907; 4,331)? Yes.
gcf (hcf, gcd) (2,907; 4,331) = 1