Question

Explanation:
theorem 1.1 ( Euclid's division Lemma)
​

Answer 1

Answer:

Theorem 1.1 (Euclid's Division Lemma) : Given positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 ≤ r < b. This result was perhaps known for a long time, but was first recorded in Book VII of Euclid's Elements. Euclid's division algorithm is based on this lemma.

Answer 2

Answer:

Given positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 ≤ r < b. This result was perhaps known for a long time, but was first recorded in Book VII of Euclid's Elements. Euclid's division algorithm is based on this lemma.

hello sisssssssssssssssssss