Euclid’s division lemma states that for integers a and b (b > 0) there exist unique integers q and r such that:
- A. a = bq + r, 0 ≤ r < b
- B. a = bq − r, r > b
- C. a = q + r
- D. a = b + q + r
View the correct answer
Correct option: A — a = bq + r, 0 ≤ r < b
This is the starting tool for the Euclidean algorithm to find HCF.
