Question

Let a and b be any two positive integers then there exists unique integers q and r such that a bq+r, Osr<b is

(a)Euclid's division lemma

(b) Thales theorem

(c) Angle bisector theorem

(d) Pythagoras theorem​

Answer 1

Step-by-step explanation:

→⚘Solution-:

Required answer:- ✅

Let a and b be any two positive integers then there exists unique integers q and r such that a bq+r, Osr<b is Euclid's division Lemma:

Find more-:✅

• →It tells us about the divisibility of integers.
• ⚘→It states that any positive integer 'a' can be divided by any other positive integer' b' in such a way that it leaves a remainder 'r'.

• ⚘→Euclid's division Lemma states that for any two positive integers 'a' and 'b' there exist two unique whole numbers 'q' and 'r' such that, a = bq + r, where O<r<b.

• ⚘→Here, a= Dividend, b= Divisor, q= quotient and r = Remainder. Hence, the values 'r' can take 0<r<b.
• Hope it helps you mate :)

#Be brainly

✌☺️

☺️✌

$→⚘$

$\:$

Answer 2

Step-by-step explanation:

→⚘Solution-:

Required answer:- ✅

Let a and b be any two positive integers then there exists unique integers q and r such that a bq+r, Osr<b is Euclid's division Lemma:

Find more-:✅

• →It tells us about the divisibility of integers.

⚘→It states that any positive integer 'a' can be divided by any other positive integer' b' in such a way that it leaves a remainder 'r'.

⚘→Euclid's division Lemma states that for any two positive integers 'a' and 'b' there exist two unique whole numbers 'q' and 'r' such that, a = bq + r, where O<r<b.

⚘→Here, a= Dividend, b= Divisor, q= quotient and r = Remainder. Hence, the values 'r' can take 0<r<b.

Hope it helps you mate :)

#Be brainly

♡︎♡︎♡︎