If gcd (a, b) is defined by the expression, d=a*p + b*q where

If gcd (a, b) is defined by the expression, d=a*p + b*q where d, p, q are positive integers and a, b is both not zero, then what is the expression called?

A. Bezout’s Identity

B. Multiplicative Identity

C. Sum of Product

D. Product of Sum

I got this question in an online quiz.

The question is from GCD LCM Recursion, topic in chapter Recursion of Data Structures & Algorithms II

Right choice is A. Bezout’s Identity

Explanation: If gcd (a, b) is defined by the expression, d=a*p + b*q where d, p, q are positive integers and a, b is both not zero, then the expression is called Bezout’s Identity and p, q can be calculated by extended form of Euclidean algorithm.