Question

theorem 1.1 euclids lemma​

Answer 1

Answer:

According to Euclid's Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b. The basis of the Euclidean division algorithm is Euclid's division lemma. ... Now, here a = 980, b = 78, q = 12 and r = 44.

Answer 2

HELLO DEAR...

HERE IS YOUR ANSWER :

Euclid's division lemma theorem - For the given positive integers a and b , there exists unique integers q and r satisfying a = bq + r where 0 < r < b.

HOPE IT HELPS DEAR...