Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
2,849 = 7 × 11 × 37
2,849 is not a prime number but a composite one.
196 = 22 × 72
196 is not a prime number but a composite one.
* The natural numbers that are only divisible by 1 and themselves are called prime numbers. A prime number has exactly 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):
Multiply all the common prime factors, taken by their smallest powers (exponents).
gcf, hcf, gcd (2,849; 196) = 7
gcf, hcf, gcd (2,849; 196) = 7
The two numbers have common prime factors.
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:
2,849 ÷ 196 = 14 + 105
Step 2. Divide the smaller number by the above operation's remainder:
196 ÷ 105 = 1 + 91
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
105 ÷ 91 = 1 + 14
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
91 ÷ 14 = 6 + 7
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
14 ÷ 7 = 2 + 0
At this step, the remainder is zero, so we stop:
7 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
The greatest (highest) common factor (divisor):
gcf, hcf, gcd (2,849; 196) = 7
gcf, hcf, gcd (2,849; 196) = 7