find the HCF of 81 and 675 by using Euclid division Lemma
Answers
Answered by
3
Answer:
We have to find HCF of 81 and 675 using the Euclidean division algorithm. Now, the remainder becomes zero. Here, we see that 27 is the number which when divides, the remainder obtained is 0. Therefore, the HCF of 675 and 81 will be 27.
Answered by
7
Answer:
hope it helps you
have a great day
Attachments:
Similar questions