Question

GCD of a = p×p×q×r×s and b = p×r×r×s is

Answer 1

Answer:

Numbers p and q like this can be computed with the extended Euclidean algorithm. gcd(a, 0) = |a|, for a ≠ 0, since any number is a divisor of