Question

The scheme where you can find the greatest common divisor of two integers by repetitive application of the division algorithm is known as the Brady algorithm. True False

Answer 1

False

Explanation:

Euclidean Algorithm is the algorithm that allows us to find the greatest common divisor (gcd) of two integers by repetitive application of the division algorithm.

A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder.

Quotient and/or Remainder =
`(N)/(D)`