Computer Science, asked by raj258935, 6 months ago

write the step to find the gcd of any two number​​

Answers

Answered by thesonofkrishna
6

Answer: Greatest common divisors can in principle be computed by determining the prime factorizations of the two numbers and comparing factors, as in the following example: to compute gcd(18, 84), we find the prime factorizations 18 = 2 · 32 and 84 = 22 · 3 · 7 and the "overlap" of the two expressions is 2 · 3; so gcd(18, 84) = 6. In practice, this method is only feasible for small numbers; computing prime factorizations in general takes far too long.

Answered by ramachandranrakshan
3

Answer:

Answer: Greatest common divisors can in principle be computed by determining the prime factorizations of the two numbers and comparing factors, as in the following example: to compute gcd(18, 84), we find the prime factorizations 18 = 2 · 32 and 84 = 22 · 3 · 7 and the "overlap" of the two expressions is 2 · 3; so gcd

Similar questions