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

The following real number is expressed in decimal form. Determine whether it is rational or not. If it is rational,express it in the form of $\frac{p}{q}$. $0.\overline{001}$

Find the largest number that divides $2053$ and $967$ and leaves a remainder of $5$ and $7$ respectively.

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

Prove that one and only one out of $n, n+2, n+4$ is divisible by $3$,where $n$ is any positive integer.

If $k_{1}$ and $k_{2}$ are two distinct prime integers,then their $\text{l.c.m.}$ is ..........

Vedclass Test Series

Exam Paper Generator

Online Exam Module