Question

use euclid's division algorithm to find the HCF of 1288 and 575​

Answer 1

Answer:

Hello ♥️♥️♥️

Step-by-step explanation:

As We know that

_______________________

Euclid's division algorithm

Let a and b be the two positive

integer then there exists two unique

whole number q and r such that

a=bq+r

Where,0<_r<b

___________________________

Applying division algorithm to 1288 and 575

1288=575×2+135

575=134×4+23

134=23×6+0

The remainder has now bacome

Zero , so our procedure stop.

since the division at this stage is 23

The HCF of 1288 and 575 is 23

• Hope it help uh