1,428,971 and 874,897 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.
1,428,971 = 19 × 75,209
1,428,971 is not a prime number, is a composite one.
874,897 = 23 × 38,039
874,897 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) (1,428,971; 874,897) = 1
Are the numbers 1,428,971 and 874,897 coprime (prime to each other, relatively prime)? Yes, they are.
The numbers have no common prime factors.
gcf (hcf, gcd) (874,897; 1,428,971) = 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:
1,428,971 ÷ 874,897 = 1 + 554,074
Step 2. Divide the smaller number by the above operation's remainder:
874,897 ÷ 554,074 = 1 + 320,823
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
554,074 ÷ 320,823 = 1 + 233,251
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
320,823 ÷ 233,251 = 1 + 87,572
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
233,251 ÷ 87,572 = 2 + 58,107
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
87,572 ÷ 58,107 = 1 + 29,465
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
58,107 ÷ 29,465 = 1 + 28,642
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
29,465 ÷ 28,642 = 1 + 823
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
28,642 ÷ 823 = 34 + 660
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
823 ÷ 660 = 1 + 163
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
660 ÷ 163 = 4 + 8
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
163 ÷ 8 = 20 + 3
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
8 ÷ 3 = 2 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
3 ÷ 2 = 1 + 1
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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) (1,428,971; 874,897) = 1
Are the numbers 1,428,971 and 874,897 coprime (prime to each other, relatively prime)? Yes, they are.
gcf (hcf, gcd) (874,897; 1,428,971) = 1