Find the HCF of 15 and 66 using Euclid’s division algorithm.
Answers
Answered by
0
Answer:
The Highest common factor of 66, 15 is 3 the largest common factor that exactly divides two or more numbers with remainder 0.
Answered by
0
Answer: 3
Step-by-step explanation:
a = bq+a
66 = 15x4+6
15 = 6x2+3
15 =3x5+0
HCF of 15 66 is 3.
Similar questions