Math, asked by Yakaiah, 1 year ago

what is euclids division algorithm formula​


sushmitha24853: a=bq+r, 0<=r
Yakaiah: a= bq+r and q is not equals to 0

Answers

Answered by Anonymous
0

Answer:-:-

a=bq+r

This is Euclid's division algorithm

Rule to be satisfied:-

if and b are integers where a and b are integers and b is not equal to 0.there exists uniquely determined integers q and r.

we can observe the following in the solution,

0<r<b

a>b

Example:-

for example check the attachment

Attachments:

Yakaiah: yaaa
Yakaiah: but
Anonymous: ??
Yakaiah: 0 is equal to or greater than B
sushmitha24853: ??
Yakaiah: 0_
Yakaiah: 0<=r
Yakaiah: ohhhh
Yakaiah: your write
Answered by Manavpanchasara
0

Here is your answer...

Dividend = Divisor × Quotient +Remainder

This is the Euclid's division algorithm


Yakaiah: yaaa
Similar questions