3,240 and 1,450 are not relatively prime -- if there is at least one number that evenly divides the two numbers (without a remainder) -- or, in other words -- if their greatest (highest) common factor (divisor), gcf (hcf, gcd), is not 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.
3,240 = 23 × 34 × 5
3,240 is not a prime number, is a composite one.
1,450 = 2 × 52 × 29
1,450 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).
gcf (hcf, gcd) (3,240; 1,450) = 2 × 5 = 10
Coprime numbers (prime to each other, relatively prime) (3,240; 1,450)? No.
The two numbers have common prime factors.
gcf (hcf, gcd) (1,450; 3,240) = 10
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:
3,240 ÷ 1,450 = 2 + 340
Step 2. Divide the smaller number by the above operation's remainder:
1,450 ÷ 340 = 4 + 90
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
340 ÷ 90 = 3 + 70
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
90 ÷ 70 = 1 + 20
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
70 ÷ 20 = 3 + 10
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
20 ÷ 10 = 2 + 0
At this step, the remainder is zero, so we stop:
10 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
gcf (hcf, gcd) (3,240; 1,450) = 10
Coprime numbers (prime to each other, relatively prime) (3,240; 1,450)? No.
gcf (hcf, gcd) (1,450; 3,240) = 10