Find the g.c.d. (Greatest Common Divisor) of | vedclass

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

Question

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

Vedclass · Accepted Answer

$3$

Vedclass · Answer

(B) To find the $g.c.d.$ of $81$ and $237$ using Euclid's division algorithm,we follow these steps:Step $1$: Apply Euclid's division lemma to $237$ and $81$ $(237 > 81)$:$237 = 81 	imes 2 + 75$Step $2$: Apply the lemma to $81$ and $75$:$81 = 75 	imes 1 + 6$Step $3$: Apply the lemma to $75$ and $6$:$75 = 6 	imes 12 + 3$Step $4$: Apply the lemma to $6$ and $3$:$6 = 3 	imes 2 + 0$Since the remainder is $0$,the divisor at this stage is the $g.c.d.$Therefore,the $g.c.d.$ of $81$ and $237$ is $3$.

Find the $g.c.d.$ (Greatest Common Divisor) of $81$ and $237$ using Euclid's division algorithm.

Similar Questions

Find the square root of $30-2 \sqrt{56}$.

Can two numbers have $18$ as their $HCF$ and $380$ as their $LCM$? Give reasons.

Find the largest number which divides $245$ and $1029$ leaving remainder $5$ in each case.

Prove that $8^{n}$ cannot end in zero for any natural number $n \in N$.

The conjugate surd of $3+\sqrt{2}$ is $\ldots \ldots \ldots \ldots .$

Vedclass Test Series

Exam Paper Generator

Online Exam Module