For any polynomial r, gcd(p, q) equals which equivalent GCD expression?
Agcd(p + q, rq)
Bgcd(p, q - r)
Cgcd(q, p + rq)
Dgcd(r, p * q)
Answer & Solution
Correct answer: C. gcd(q, p + rq)
Adding a polynomial multiple of q to p leaves their common divisors and GCD unchanged.
Keep practising Algebra: factorisation
Browse all Algebra: factorisation questions for ICSE Class 9, or explore more Mathematics topics.
Related questions
Match each algebraic theorem with its mathematical statement:Match each quadratic trinomial with its factored binomials:Match each polynomial with its complete factorisation:Match each sum or difference of cubes with its factored binomial-trinomial form:Multiple roots of a polynomial are roots of the GCD of itself and its:In the Euclidean algorithm, the polynomial GCD is obtained from the:In Euclid's algorithm for polynomials, what strictly decreases each step?What is the greatest common divisor of x^2 + 7x + 6 and x^2 - 5x - 6?