Question

Tell me about Euclid's Division Algorithm.
✔Plzz give me such examples.​

Answer 1

${} \huge \purple{Euclid's \: Division \: Algorithm}$

It is based on Euclid's division lemma and is a technique to find the HCF of two given positive integers.

Algorithm-

• If a and b are two positive integers such that a = bq + r,then every common divisor of a and b is a common divisor of b and r and vice- versa.

Note:-

Euclid's divison lemma is different from division algorithm. Division algorithm is a procedure whereas lemma is statement about divisibility of a positive integer by another integer.

==========================

Answer 2

Answer:

dear friend,

I am happy to say you that my previous account which was sanidhya973 is active now and I request you to follow me on that one.

if you wish you could unfollow this one but must follow Sanidhya 973

both the accounts are following each other

thank you so much for your love and support.

I will definitely help you in Physics and Chemistry till class 11

and I promise the answers would be the best answer which you could ever see

goodbye