find H. C. F of 36 and 48 by using Euclid's division Algoritham
Answers
1. What is the HCF(36, 48)?
The Highest common factor of 36, 48 is 12 the largest common factor that exactly divides two or more numbers with remainder 0.
2. How do you find HCF of 36, 48 using the Euclidean division algorithm?
According to the Euclidean division algorithm, if we have two integers say a, b ie., 36, 48 the largest number should satisfy Euclid's statement a = bq + r where 0 ≤ r < b and get the highest common factor of 36, 48 as 12.
3. Where can I get a detailed solution for finding the HCF(36, 48) by Euclid's division lemma method?
You can get a detailed solution for finding the HCF(36, 48) by Euclid's division lemma method on our page
❤≛⃝☆ mamtaہہ٨ answer
Answer:
The correct answer is 12
Step-by-step explanation:
a=bq+r
48=36×1+12
36=12×3+0
Therefore,The HCF is 12