Question

Find the HCF of 1288 and 575 using Euclid's division algorithm

Answer 1

Answer:

Step-by-step explanation:

Euclid's division algorithm:

Let a and b be any two positive

integers then there exists two unique

whole numbers q and r such that

a = bq + r ,

Where, 0 ≤ r < b

__________________________

Applying division algorithm to 1288

and 575

1288 = 575 × 2 + 138

575 = 138 × 4 + 23

138 = 23 × 6 + 0

The remainder has now become

zero, so our procedure stops .

Since the divisor at this stage is 23.

The HCF of 1288 and 575 is 23

I hope this helps you.