Find the g.c.d. of 240 and 6552 using Euclid' | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(D) To find the $g.c.d.$ of $240$ and $6552$ using Euclid's division algorithm,we follow these steps:Step $1$: Apply Euclid's division lemma to $6552$

Vedclass · Accepted Answer

$24$

Vedclass · Answer

(D) To find the $g.c.d.$ of $240$ and $6552$ using Euclid's division algorithm,we follow these steps:Step $1$: Apply Euclid's division lemma to $6552$ and $240$:$6552 = 240 	imes 27 + 72$Step $2$: Apply the lemma to $240$ and $72$:$240 = 72 	imes 3 + 24$Step $3$: Apply the lemma to $72$ and $24$:$72 = 24 	imes 3 + 0$Since the remainder is $0$,the divisor at this stage is the $g.c.d.$Therefore,the $g.c.d.$ of $240$ and $6552$ is $24$.

Find the $g.c.d.$ of $240$ and $6552$ using Euclid's division algorithm.

Similar Questions

If $\text{g.c.d.} (a, b) = b$,then $\text{l.c.m.} (a, b) = \dots$ (where,$a, b \in N$)

The $HCF$ of the smallest prime number and the smallest composite number is ........

If $HCF(p, q) = p$,then $LCM(p, q)$ is equal to . . . . . . .

Given that $HCF (306, 657) = 9$,find $LCM (306, 657)$.

If $HCF(306, 657) = 9$,find $LCM(306, 657)$.

Vedclass Test Series

Exam Paper Generator

Online Exam Module