Find the text{g.c.d.} of 867 and 255 using Eu | vedclass

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

Question

(A) To find the $	ext{g.c.d.}$ of $867$ and $255$ using Euclid's division algorithm,we follow these steps:Step $1$: Since $867 > 255$,we apply Euclid

Vedclass · Accepted Answer

$51$

Vedclass · Answer

(A) To find the $	ext{g.c.d.}$ of $867$ and $255$ using Euclid's division algorithm,we follow these steps:Step $1$: Since $867 > 255$,we apply Euclid's division lemma to $867$ and $255$:$867 = 255 	imes 3 + 102$Step $2$: Since the remainder $102 
eq 0$,we apply the lemma to $255$ and $102$:$255 = 102 	imes 2 + 51$Step $3$: Since the remainder $51 
eq 0$,we apply the lemma to $102$ and $51$:$102 = 51 	imes 2 + 0$Since the remainder is now $0$,the divisor at this stage is the $	ext{g.c.d.}$.Therefore,the $	ext{g.c.d.}$ of $867$ and $255$ is $51$.

Find the $\text{g.c.d.}$ of $867$ and $255$ using Euclid's division algorithm.

Similar Questions

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

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

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

The Least Common Multiple $(LCM)$ of two distinct prime numbers $a$ and $b$ is:

Find the $G$.$C$.$D$. of $(28, 35, 91)$.

Vedclass Test Series

Exam Paper Generator

Online Exam Module