1,428,955 and 874,770 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,428,955 = 5 × 11 × 25,981
1,428,955 is not a prime number, is a composite one.
874,770 = 2 × 3 × 5 × 13 × 2,243
874,770 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,428,955; 874,770) = 5 ≠ 1
Are the numbers 1,428,955 and 874,770 coprime (prime to each other, relatively prime)? No, they are not.
The two numbers have common prime factors.
gcf (hcf, gcd) (874,770; 1,428,955) = 5 ≠ 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,955 ÷ 874,770 = 1 + 554,185
Step 2. Divide the smaller number by the above operation's remainder:
874,770 ÷ 554,185 = 1 + 320,585
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
554,185 ÷ 320,585 = 1 + 233,600
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
320,585 ÷ 233,600 = 1 + 86,985
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
233,600 ÷ 86,985 = 2 + 59,630
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
86,985 ÷ 59,630 = 1 + 27,355
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
59,630 ÷ 27,355 = 2 + 4,920
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
27,355 ÷ 4,920 = 5 + 2,755
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,920 ÷ 2,755 = 1 + 2,165
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,755 ÷ 2,165 = 1 + 590
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,165 ÷ 590 = 3 + 395
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
590 ÷ 395 = 1 + 195
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
395 ÷ 195 = 2 + 5
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
195 ÷ 5 = 39 + 0
At this step, the remainder is zero, so we stop:
5 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,955; 874,770) = 5 ≠ 1
Are the numbers 1,428,955 and 874,770 coprime (prime to each other, relatively prime)? No, they are not.
gcf (hcf, gcd) (874,770; 1,428,955) = 5 ≠ 1