Question

what Euclid's division algorithm...???​

Answer 1

Answer:

a= bq+r

Explanation:

formula of Euclid's division algorithm

Answer 2

Explanation:

Euclid Division algorithm. is a technique to compute the HCF of any two or more than positive numbers.HCF of two positive integers a and b. is the largest of d that divides the both a and b.

For example:-a=bx(q+r).

Where r means remaindeer and q means quotient

So,0<=r<b

For Example :-

Let us suppose a dividend is 27 is 'a' and the divisior 'b' 8 .

27÷8

Now, Divisor is 8 and divident is 27 and 3 is quotient and the remain remaindeer is 3.

Hence it can be written in a=bx (q+r)

Hope that's may helpful .