Computer Science, asked by rinkoobhai222, 10 months ago

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

Answers

Answered by Anonymous
4

Explanation:

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) ..

Answered by subhrajena189
0

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) ...

Explanation:

if this answer helps you then plz.Mark the answer as brainliest..

Similar questions