Question

Find the value of q and r in a=62, b=7 dividion algoriytm
who ever gives the correct answer I will mark thrm as brainliest promise
​

Answer 1

Euclid's Divison Lemma:

Given positive integers 'a' and 'b' , there exist unique pair of integers 'q' and 'r' satisfying

a=bq+r

0 ≤ r < b .

Here , a = 62 , b = 7

62 = 7 x 8 + 6

Compare a = bq + r, we get,

q = 8

r = 6

Mark as brainliest please.