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

Find the $LCM$ and $HCF$ of the following integers by applying the prime factorisation method: $8, 9$ and $25$.

Find the $HCF$ of $12$,$15$,and $21$.

Find the $\text{g.c.d.}$ and $\text{l.c.m.}$ of $12$,$15$,and $21$ using the fundamental theorem of arithmetic.

Find the largest number which divides $615$ and $963$ leaving remainder $6$ in each case.

Vedclass Test Series

Exam Paper Generator

Online Exam Module