Euclid's division algori than is a techniqueto compute
the highest common factor ( HCF) of two or three given positive integers.
Euclid's division lemma states that for any two positive integers say a and b there exist two unique whole numbers say q and r,such that a bq +r, where 0 < r,< b
❤⭐❤⭐❤⭐❤⭐
THANK YOU. ❤
❤⭐❤⭐❤⭐❤⭐
Answers & Comments
step 1 of 3
applying Euclid's division lemma for 135 and 225:
here,225>135.
let a=275 and b =135
225=135 × 1+90
here,r=90 0.
so take a new individual as 135 and divisor as 90.
step 2 of 3
applying Euclid's division lemma for 136 and 90:
here,135 > 90
let a =135 and b =90
135=90×1+45
here,r=45 0
so take a new dividen as 90 and divisor as 45.
step 3 of 3
applying Euclid's division lemma for 90 and 45:
here,90 > 45
let a =90 and b =45
90=45× 2+0
here,the remainder at this stage is zero and the divisor at this stage is 45.
hence,the HCF of 135 and 225 is 45.
❤⭐❤⭐❤⭐❤⭐❤
#Carry on learning
❤⭐❤⭐❤⭐❤⭐❤
Txunamyortiz54.
❤⭐❤⭐❤⭐❤⭐❤
Answer:
hi I was wondering re the your complete solutions w the same thing but I'm sure I can find it is a type in the following week ago but it represents currently try it represents iee the same I am going