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

Every odd integer $a$ is in the form of $\ldots \ldots \ldots \ldots$ where,$k \in Z$.

Find the remainder and quotient when dividing $10^{k}+1$ by $11$,where $k=1, 2, 3, 4, 5$.

Prove that any positive odd integer is of the form $6m+1$ or $6m+3$ or $6m+5$,where $m \in N \cup \{0\}$.

Prove that the following number is irrational: $3 \sqrt{5}$.

The product of two conjugate binomial surds is ...........

Vedclass Test Series

Exam Paper Generator

Online Exam Module