2020 · Q44
The Euclidean algorithm is used to calculate the
Elementary MathematicsHCF and LCM
- Asquare root of an integer
- Bcube root of an integer
- Csquare of an integer
- DHCF of two integers
Explanation
The Euclidean algorithm computes the HCF (greatest common divisor) of two integers - option (D).It works by repeated division with remainder until the remainder is zero. The last nonzero remainder is the HCF.