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

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

Vedclass · Accepted Answer

$5$

Vedclass · Answer

(A) To find the $g.c.d.$ of $155$ and $1385$ using Euclid's division algorithm,we follow these steps:Step $1$: Apply Euclid's division lemma to $1385$ and $155$:$1385 = 155 	imes 8 + 145$Step $2$: Apply the lemma to $155$ and $145$:$155 = 145 	imes 1 + 10$Step $3$: Apply the lemma to $145$ and $10$:$145 = 10 	imes 14 + 5$Step $4$: Apply the lemma to $10$ and $5$:$10 = 5 	imes 2 + 0$Since the remainder is $0$,the divisor at this stage is the $g.c.d.$Therefore,the $g.c.d.$ of $155$ and $1385$ is $5$.

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

Similar Questions

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

The $HCF$ of the smallest prime number and the smallest composite number is ........

The Least Common Multiple $(LCM)$ of the smallest prime number and the smallest composite number is . . . . . . .

Find the $LCM$ and $HCF$ of $6$ and $20$ by the prime factorisation method.

The $\text{g.c.d.}$ (greatest common divisor) of any two consecutive natural numbers is:

Vedclass Test Series

Exam Paper Generator

Online Exam Module