The scheme where you can find the greatest common divisor of two integers by repetitive application of the division algorithm is

Question

Scilla [17]

2 years ago

8

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

Mathematics

1 answer:

HACTEHA [7] · Answer 1 · 2022-05-22T12:08:00+03:00

Answer:

False

Step-by-step 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 = $\frac{N}{D}$