Find the hcf of 1260 and 7344 using Euclid's division algorithm
Answers
Answered by
161
36 is the HCF of 1260 and 7344 by Euclid division algorithm
Attachments:
Answered by
89
36 is the HCF of 1260 and 7344
Step-by-step explanation:
Euclid Division Algorithm:
According to Euclid's division algorithm, any positive integer a can be expressed as a = bq + r
Where q is quotient, b is divisor and r is remainder, 0 ≤ r < b.
It is a technique used to find the highest common factor of positive integers. HCF is largest number which divides both integers until remainder becomes zero.
Out of the two given numbers, we consider the greater number first and then follow Euclid's algorithm.
Now, here 7344 is the greatest number among the given numbers.
Therefore, 36 is the HCF of 7344 and 1260.
Attachments:
Similar questions