- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- If gcd (a, b) is defined by the expressi...

Q. |
## 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 |

Answer» 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. |

View all MCQs in:
Design and Analysis of Algorithms

- What is the computational complexity of Binary GCD algorithm where a and b are integers?
- Who gave the expression for the probability and expected value of gcd?
- In terms of Venn Diagram, which of the following expression gives GCD (Given A ꓵ B ≠ Ø)?
- What is the following expression, lcm (a, gcd (a, b)) equal to?
- If GCD of two number is 8 and LCM is 144, then what is the second number if first number is 72?
- What is the GCD of a and b?
- Which of the following is also known as GCD?
- What is the GCD according to the given Venn Diagram?
- What is the GCD of 48, 18, 0?
- Is gcd an associative function.

Login to Continue

It will take less than 2 minutes

Report MCQ