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

If $\text{g.c.d.}(12, 40) = 40 + 4x$,then $x = \dots$

The decimal form of $\frac{12}{35}$ is $\ldots \ldots \ldots \ldots$

Find the $\text{g.c.d.}$ (Greatest Common Divisor) of $196$ and $38220$ using Euclid's division algorithm.

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 one of any three consecutive positive integers must be divisible by $3$.

Vedclass Test Series

Exam Paper Generator

Online Exam Module