Coprime numbers, prime to each other, relatively prime: 144 and 4,217?

144 and 4,217 are coprime (relatively, mutually prime) if they have no common prime factors, that is, if their greatest (highest) common factor (divisor), gcf, hcf, gcd, is 1.

coprime (144; 4,164)? ... (144; 3,068)?

Calculate the greatest (highest) common factor (divisor), gcf, hcf, gcd.
Two methods used below.

Approach 1. Integer numbers prime factorization:

Prime Factorization of a number: finding the prime numbers that multiply together to make that number.


144 = 24 × 32;
144 is not a prime, is a composite number;


4,217 is a prime number, it cannot be broken down to other prime factors;


* Positive integers that are only dividing by themselves and 1 are called prime numbers. A prime number has only two factors: 1 and itself.
* A composite number is a positive integer that has at least one factor (divisor) other than 1 and itself.


Calculate greatest (highest) common factor (divisor):

Multiply all the common prime factors, by the lowest exponents (if any).


But the two numbers have no common prime factors.


gcf, hcf, gcd (144; 4,217) = 1;
coprime numbers (relatively prime)



Coprime numbers (relatively prime) (144; 4,217)? Yes.
Numbers have no common prime factors.
gcf, hcf, gcd (144; 4,217) = 1.

>> Integer numbers prime factorization


Approach 2. Euclid's algorithm:

This algorithm involves the operation of dividing and calculating remainders.


'a' and 'b' are the two positive integers, 'a' >= 'b'.


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


If 'r' = 0, STOP. 'b' = the GCF (HCF, GCD) of 'a' and 'b'.


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



Step 1. Divide the larger number by the smaller one:
4,217 ÷ 144 = 29 + 41;
Step 2. Divide the smaller number by the above operation's remainder:
144 ÷ 41 = 3 + 21;
Step 3. Divide the remainder from the step 1 by the remainder from the step 2:
41 ÷ 21 = 1 + 20;
Step 4. Divide the remainder from the step 2 by the remainder from the step 3:
21 ÷ 20 = 1 + 1;
Step 5. Divide the remainder from the step 3 by the remainder from the step 4:
20 ÷ 1 = 20 + 0;
At this step, the remainder is zero, so we stop:
1 is the number we were looking for, the last remainder that is not zero.
This is the greatest common factor (divisor).


gcf, hcf, gcd (144; 4,217) = 1;

Why is the answer a factor (a divisor) of the initial 'a' and 'b'?

Note: 'a' ÷ 'b' = 'q' + 'r' is equivalent to the equation: 'a' = 'q' × 'b' + 'r', where 'q' is the quotient of the operation.


When the final value of 'r' = 0, the final value of 'b' is a factor (a divisor) of the final value of 'a', since 'a' = 'q' × 'b' + 0.


Go backwards the previous division steps, through each equation, 'a' = 'q' × 'b' + 'r', and notice that at each step the final value of 'b' is a factor (a divisor) of each value of 'r' and of each value of 'b' and therefore is a factor of each value of 'a'. So the final value of 'b', which is the last remainder in our list that is not zero, is a factor of the initial values of ('a' and 'b'), or in other words, is a divisor of the intial values of ('a' and 'b').


Why is the answer equal to the CGF (HCF, GCD)?

Look at all the equations: 'a' = 'q' × 'b' + 'r'. As we saw above, the final value of 'b' is a factor of all the values of 'a', 'b', and 'r'.


Therefore the final value of 'b' must also be a factor of the last value of 'r', the one that is not zero. And the final value of 'b' couldn't be larger than that value. But the final value of 'b' is actually equal to that value of 'r', therefore the final value of 'b' is the largest factor (divisor) of the initial values of 'a' and 'b'. And by definition it's called the greatest (highest) common factor (divisor) of numbers.


Coprime numbers (relatively prime) (144; 4,217)? Yes.
gcf, hcf, gcd (144; 4,217) = 1.

>> Euclid's algorithm

Final answer:

144 and 4,217 are coprime (relatively, mutually prime) if they have no common prime factors, that is, if their greatest (highest) common factor (divisor), gcf, hcf, gcd, is 1.
Coprime numbers (relatively prime) (144; 4,217)? Yes.
gcf, hcf, gcd (144; 4,217) = 1.

More operations of this kind:

coprime (144; 4,164)? ... (144; 3,068)?

Online calculator: coprime numbers (prime to each other)?

Coprime numbers or not (relatively prime, prime to each other or not)? Latest operations

Coprime numbers (numbers prime to each other, relatively prime, mutually prime)

Integers "a" and "b" are said to be relatively prime, mutually prime, or coprime if the only positive integer that divides both of them is 1. This is equivalent to their only common positive factor being 1. This is also equivalent to their greatest common factor (divisor) being 1.

For example, 16 and 17 are coprime, being commonly divisible by only 1, but 16 and 24 are not, because they are both divisible by 8. The numbers 1 and -1 are the only integers coprime to every integer, and they are the only integers to be coprime with 0. A fast way to determine whether two numbers are coprime is given by the Euclidean algorithm: Euclid's algorithm


What is a prime number?

What is a composite number?

Prime numbers up to 1,000

Prime numbers up to 10,000

Sieve of Eratosthenes

Euclid's algorithm

Simplifying ordinary (common) math fractions (reducing to lower terms): steps to follow and examples