Math, asked by yazhini661, 11 months ago

explain euclid's division Lemma ..

plz friends it important..

as fast as u can .
plz ..​

Answers

Answered by bunny1651
3

For a pair of given positive integers ‘a’ and ‘b’, there exist unique integers ‘q’ and ‘r’ such that

a=bq+r" role="presentation" style="display: inline-block; line-height: 0; text-indent: 0px; text-align: left; text-transform: none; font-style: normal; font-weight: normal; font-size: 19.04px; letter-spacing: normal; overflow-wrap: normal; word-spacing: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; margin: 0px; padding: 1px 0px; position: relative;">a=bq+ra=bq+r, where 0&#x2264;r&lt;b" role="presentation" style="display: inline-block; line-height: 0; text-indent: 0px; text-align: left; text-transform: none; font-style: normal; font-weight: normal; font-size: 19.04px; letter-spacing: normal; overflow-wrap: normal; word-spacing: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; margin: 0px; padding: 1px 0px; position: relative;">0≤r<b0≤r<b

Explanation:

Thus, for any pair of two positive integers a and b; the relation

a=bq+r" role="presentation" style="display: inline-block; line-height: 0; text-indent: 0px; text-align: left; text-transform: none; font-style: normal; font-weight: normal; font-size: 19.04px; letter-spacing: normal; overflow-wrap: normal; word-spacing: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; margin: 0px; padding: 1px 0px; position: relative;">a=bq+ra=bq+r, where 0&#x2264;r&lt;b" role="presentation" style="display: inline-block; line-height: 0; text-indent: 0px; text-align: left; text-transform: none; font-style: normal; font-weight: normal; font-size: 19.04px; letter-spacing: normal; overflow-wrap: normal; word-spacing: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; margin: 0px; padding: 1px 0px; position: relative;">0≤r<b0≤r<b

will be true where q is some integer


yazhini661: thanks yr
bunny1651: most welcome
yazhini661: with pleasure..
bunny1651: ok
bunny1651: it's your choice
bunny1651: anyways hii
yazhini661: hii bro
bunny1651: hello
bunny1651: where are you from
Answered by itsvarun
3

Euclid's Division Lemma: ... The basis of Euclidean division algorithm is Euclid's division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid's division algorithm. HCF is the largest number which exactly divides two or more positive integers.

Similar questions