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

Prove that $3+2 \sqrt{5}$ is an irrational number.

Prove that the following number is irrational: $\sqrt{11}$

If $n$ is a positive even integer,then $n(n+1)(n+2)$ is divisible by $\ldots \ldots \ldots \ldots .$

Simplify: $\frac{\sqrt{4-\sqrt{7}}}{\sqrt{8+3 \sqrt{7}-2 \sqrt{2}}}$

$LCM(15, 21, 35) = .........$

Vedclass Test Series

Exam Paper Generator

Online Exam Module