Question

using euclid's division Lemma the HCF of 37 and 7

Answer 1

Hey dear!!


Here is yr answer.....


HCF of 37 and 7


According to euclid's division algorithm....


a=bq+r

37 = 7 × 5 + 2

7 = 2 × 3 + 1

2 = 1 × 2 + 0


Here, remainder is zero!

So the divisor - 1 is the HCF of 37 and 7


Hope it hlpz....

Answer 2

Hello dear!!! ✌️✌️

The following pic will show you the answer of your question.....



HAVE A GREAT DAY DEAR....

I HOPE THIS WILL HELP YOU ✌️✌️

^_^