Question

write different forms of positive integer a according to the Euclid division lemma when b=3​

Answer 1

Answer:

Euclid's Division Lemma states that, if two positive integers “a” and “b”, then there exists ... General Form of Euclid's Division Lemma 34 = 10 × 3 + 4 Divisor = 34, Remainder

Answer 2

Given :

b = 3

To Find :

What are the different forms of positive integer a according to  the Euclid division lemma when b =  3 , = ?

Solution :

According to the Euclid division lemma we can write :

If 'a' and 'b' are given positive integers then 'a' can be expressed in the form of :-

a =  bq + r ,

where $o \le r \le b$

And , q is a positive integer .

∴∴Here we are given that b = 3, so r can take only three values which are 0 , 1 and 2 .

∴'a' can take forms ;

a = bq+ 0

a =  bq + 1

a = bq + 2

So, the different forms of positive integer a according the Euclid Division Lemma are :

a = bq+ 0

a =  bq + 1

a = bq + 2