Question

1 point
2. Apply Euclid Division
Algorithm in order to prove
results of positive integers in
the form of ax+b where a and b
are constants. In the equation
below, a, b, q, r are integers,
Osr<b, a is a multiple of 3 and
b=9. a=bq+r Which of the
following forms represent a?​

Answer 1

Answer:

What would you like to ask?

10th

Maths

Real Numbers

Euclid's Division Lemma

In Euclid's Division Lemma,...

MATHS

In Euclid's Division Lemma, when a=bq+r where a,b are positive integers then what values r can take?

EASY

Share

Study later

ANSWER

Euclid’s division Lemma:

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 0≤r<b.

Here, a= Dividend, b= Divisor, q= quotient and r = Remainder.

Hence, the values 'r’ can take 0≤r<b.

Answer 2

Answer:

Euclid’s  division  Lemma:

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 0≤r<b.

Here, a= Dividend, b= Divisor, q= quotient and r = Remainder.

Hence, the values 'r’ can take  0≤r<b.

please mark it as brailist