Find the gratest number that can divide 510 & 425 exactly
Answers
hello friend here's your answer..
Approach 1. Integer numbers prime factorization:
510 = 2 × 3 × 5 × 17;
425 = 52 × 17;
Take all the common prime factors, by the lowest exponents.
Greatest (highest) common factor (divisor):
gcf, gcd (510; 425) = 5 × 17 = 85;
Approach 2. Euclid's algorithm:
Step 1. Divide the larger number by the smaller one:
510 ÷ 425 = 1 + 85;
Step 2. Divide the smaller number by the above operation's remainder:
425 ÷ 85 = 5 + 0;
At this step, the remainder is zero, so we stop:
85 is the number we were looking for, the last remainder that is not zero.
This is the greatest common factor (divisor).
Greatest (highest) common factor (divisor):
gcf, gcd (510; 425) = 85 = 5 × 17;..
hope you find it useful so please mark me as brainliest..
425/85=5
85 is your ans