Question

Using Euclid divisible algorithm find HCF if 240 and 6552

Answer 1

Answer:

24

Step-by-step explanation:

a=bq+r

6552=240×27+72

240=72×3+24

72=24×3+0

Here HCF of (6552 and 240 is 24)

Answer 2

$\huge\fbox \red{Solution:}$

$\fbox \blue{By applying Euclid’s Division lemma on 6552 and 240 we get,}$

6552 = 240 x 27 + 72.

Since remainder ≠ 0, apply division lemma on divisor 240 and remainder 72

240 = 72 x 3+ 24.

Since remainder ≠ 0, apply division lemma on divisor 72 and remainder 24

72 = 24 x 3 + 0.

$\fbox \blue{Therefore, H.C.F. of 240 and 6552 is 24}$

$\rm \orange{Thanks}$