Question

Using Euclid's division algorithm, find the HCF of 5404 and 4800​

Answer 1

Answer:

Hey mate

Step-by-step explanation:

here is your answer

Answer 2

Answer:

HCF= 64

Step-by-step explanation:

Finding the highest number that divides both integers is accomplished using the Euclidean Algorithm for Finding the Highest Common Factor of Two Numbers

We may use the following steps to determine the HCF of 5404 and 4800:

The greater number is divided by the smaller number:

5404 ÷ 4800 = 1 with a remainder of 704.

Substituting the remainder for the bigger number:

HCF(5404, 4800) = HCF (4800, 704).

Divide and replace again until the remaining is zero:

4800 ÷ 704 wih a remainder of 384.

704 ÷ 384 = 1 with a remainder of 320.

384 ÷ 320 = 1 with a remainder of 64.

320 ÷ 64 = 5 with a remainder of 0.

The HCF is the last non-zero remainder:

HCF(5404, 4800) = 64.

Therefore, the greatest common divisor of 5404 and 4800 is 64.

For more questions on HCF:-

https://brainly.in/question/51846540

#SPJ3