Find the g.c.d. of the following numbers usin | vedclass

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

Question

(C) To find the $g.c.d.$ of $117$ and $65$ using Euclid's division algorithm,we follow these steps:Step $1$: Since $117 > 65$,we apply Euclid's divisi

Vedclass · Accepted Answer

$13$

Vedclass · Answer

(C) To find the $g.c.d.$ of $117$ and $65$ using Euclid's division algorithm,we follow these steps:Step $1$: Since $117 > 65$,we apply Euclid's division lemma to $117$ and $65$:$117 = 65 	imes 1 + 52$Step $2$: Since the remainder $52 
eq 0$,we apply the lemma to $65$ and $52$:$65 = 52 	imes 1 + 13$Step $3$: Since the remainder $13 
eq 0$,we apply the lemma to $52$ and $13$:$52 = 13 	imes 4 + 0$Since the remainder is now $0$,the divisor at this stage is the $g.c.d.$Therefore,the $g.c.d.$ of $117$ and $65$ is $13$.

Find the $g.c.d.$ of the following numbers using Euclid's division algorithm: $117$ and $65$.

Similar Questions

Prove that $6^{n}$ cannot end with the digit $0$ for any natural number $n \in N$.

Find : $\sqrt{7+2 \sqrt{10}}$

The smallest positive number divisible by $24, 36$,and $48$ is $\ldots \ldots \ldots \ldots .$

$(3k+2)^2$ leaves remainder ............ on dividing by $3$.

Prove that $\sqrt{p}+\sqrt{q}$ is irrational,where $p$ and $q$ are distinct prime numbers.

Vedclass Test Series

Exam Paper Generator

Online Exam Module