Question

I WILL MAKE YOU BRAINLIEST PLEASE ANSWER THIS.......MAKE A FLOWCHART TO ELABORATE AND EXPLAIN THE EUCLID'S DIVISION ALGORITHM.....

Answer 1

Euclid's division algorithm

For given positive integers a and b, there exist two unique integera q and e , satisfying the relationship
a = bq + r, where 0=
In simple words, EDA can be written as

Dividend = (Divisor x Quotient) + Remainder
a = b x q + r

For example,

1) 65 ÷ 4

Here, 65 is the dividend and 4 is the divisor.
So,
65 = 4 x 16 + 1
i. e, when 65 is divided by 4, we get 16 as quotient leaving 1 as a remainder.

Now let us take a bigger number,

2) 862 ÷ 9

Here, 862 is the dividend and 9 is the divisor.

So,
862 = 9 x 95 + 7

i. e, when 862 is divided by 9, we get 95 as quotient leaving 7 as a remainder.

Hope this helps you! :)

Answer 2

I can write from Google