Question

When we divide 8 by 3 how the remainder and quotient are same.According to euclid division algorithm a=bq+r(0<=r<3)and both quotient and remainder should be unique​

Answer 1

$\large\green{\textsf{✩ Verified Answer ✓ }}$

The larger integer is 675, therefore, by applying the Division Lemma a = bq + r where 0 ≤ r < b, we have

a = 675 and b = 81

⇒ 675 = 81 × 8 + 27

By applying Euclid’s Division Algorithm again we have,

81 = 27 × 3 + 0

We cannot proceed further as the remainder becomes zero. According to the algorithm, in this case, the divisor is 27. Hence, the HCF of 675 and 81 is 27.

Answer 2

Answer:

This is your answer hope itz helps uuuu

Step-by-step explanation:

Mark me as brainliest please