Question

find the HCF of1260 and 7344 using Euclid's algorithm
​

Answer 1

Answer:

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.

Answer 2

Answer:

7344=1260×5+1044

⟹1260=1044×1+216

⟹1044=216×4+180

⟹216=180×1+36

⟹180=36×5+0

So by Euclid's algorithm

HCFof 1260 and 7344 is 36

pls mark my ans as brainlist