Question

Explain euclid divison lemma with a hard example

Answer 1

Hi friend,

Euclid’s Division Lemma states that for any given positive integers a and b, there exists unique integers q and r such that a = bq + r, where 0 ≤ r < b.

For example:-Euclid's Division of Lemma is used in arriving at arithmetic proofs by scientists all over the world.

HOPE THIS HELPS YOU :-))

Please mark as brainliest

Answer 2

firstly, just understand one thing
a=bq+r
This will make to understand it more quickly.
Then suppose u have to find the hcf of
854 and 964.
Then divide 964 by 854.
After dividing u will get remainder as 110.
Here, one more thing comes which is
0<or equal to r and r should be greater than your b.
then start dividing again divide 854 by 110 and find the remainder now after finding the reminder repeat the same process now divide 110 with a reminder in this way you will come to a stop in which your reminder will come 0 and at that point the divisor will consider as the HCF of that particular number