The algorithm that finds that largest common divisor by repeated divis…

Question

The algorithm that finds that largest common divisor by repeated division is named after:

Accepted Answer

B. Euclid

1. A division lemma drives it.
2. Divisor and remainder are used again and again.
3. It is Euclid's algorithm.
_Source: syllabus Mathematics, Chapter 1, Real Numbers._

Answer

Ehrlich

Answer

Euler

Answer

Edison

The algorithm that finds that largest common divisor by repeated division is named after:

Keep practising HCF and LCM