Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
4,666 = 2 × 2,333
4,666 is not a prime number but a composite one.
333,333,330,000 = 24 × 3 × 54 × 11 × 73 × 101 × 137
333,333,330,000 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 (4,666; 333,333,330,000) = 2
gcf, hcf, gcd (4,666; 333,333,330,000) = 2
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:
333,333,330,000 ÷ 4,666 = 71,438,776 + 1,184
Step 2. Divide the smaller number by the above operation's remainder:
4,666 ÷ 1,184 = 3 + 1,114
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,184 ÷ 1,114 = 1 + 70
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
1,114 ÷ 70 = 15 + 64
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
70 ÷ 64 = 1 + 6
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
64 ÷ 6 = 10 + 4
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6 ÷ 4 = 1 + 2
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4 ÷ 2 = 2 + 0
At this step, the remainder is zero, so we stop:
2 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 (4,666; 333,333,330,000) = 2
gcf, hcf, gcd (4,666; 333,333,330,000) = 2