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 $75$ and $243$ using Euclid's division algorithm,we apply the lemma $a = bq + r$ where $0 \le r < b$.Step $1$: Divide $243

Vedclass · Accepted Answer

$3$

Vedclass · Answer

(B) To find the $g.c.d.$ of $75$ and $243$ using Euclid's division algorithm,we apply the lemma $a = bq + r$ where $0 \le r Step $1$: Divide $243$ by $75$.$243 = 75 	imes 3 + 18$Step $2$: Divide $75$ by $18$.$75 = 18 	imes 4 + 3$Step $3$: Divide $18$ by $3$.$18 = 3 	imes 6 + 0$Since the remainder is $0$,the divisor at this stage is the $g.c.d.$Therefore,the $g.c.d.$ of $75$ and $243$ is $3$.

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

Similar Questions

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

State whether the following rational number has a terminating decimal expansion or not. If it has,then find it: $\frac{55}{150}$

State whether the following rational number has a terminating decimal expansion or not. If it has a terminating decimal expansion,find it: $\frac{17}{8}$

The value of $\text{g.c.d.}(18, 24) \times \text{l.c.m.}(18, 24) = \dots$

$n^{2}-1$ is divisible by $8,$ if $n$ is

Vedclass Test Series

Exam Paper Generator

Online Exam Module