Question

answer the question ​

Answer 1

Answer:

a =bq+r

Explanation:

Euclid's lemma — If a prime p divides the product ab of two integers a and b, then p must divide at least one of those integers a and b. For example, if p = 19, a = 133, b = 143, then ab = 133 × 143 = 19019, and since this is divisible by 19, the lemma implies that one or both of 133 or 143 must be as well.

Answer 2

Answer:

❤️Euclid Division Lemma :-

Let a and b are any two positive integers , there exists a unique pair of integers q and r satisfying

❤️a = bq + r where

a > b , 0 ≤ r < b

❤️By Euclid division Lemma / algorithm we can find HCF of any two positive integers .

✔️ Example ✔️ :-

Refer the above mentioned attachment Buddy......

❤️❤️❤️❤️❤️❤️❤️❤️❤️