Use Euclid's division algorithm to find the H | vedclass

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

Question

(C) Given numbers are $867$ and $255$.Since $867 > 255$,we apply Euclid's division lemma to $867$ and $255$ to obtain:$867 = 255 	imes 3 + 102$Since

Vedclass · Accepted Answer

$51$

Vedclass · Answer

(C) Given numbers are $867$ and $255$.Since $867 > 255$,we apply Euclid's division lemma to $867$ and $255$ to obtain:$867 = 255 	imes 3 + 102$Since the remainder $102 
eq 0$,we apply the division lemma to $255$ and $102$ to obtain:$255 = 102 	imes 2 + 51$Since the remainder $51 
eq 0$,we apply the division lemma to $102$ and $51$ to obtain:$102 = 51 	imes 2 + 0$Since the remainder is $0$,the process stops.The divisor at this stage is $51$.Therefore,the $HCF$ of $867$ and $255$ is $51$.

$Q.1.$ $HCF$ of $8$ and $6$	$A. 49$
$Q.2.$ $LCM$ of $(26, 91)$	$B. 182$
	$C. 2$

Use Euclid's division algorithm to find the $HCF$ of $867$ and $255$.

Similar Questions

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

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

If $m$ and $n$ are distinct prime integers,then their $HCF$ is .......... .

Find the $LCM$ and $HCF$ of the following pairs of integers and verify that $LCM \times HCF =$ product of the two numbers $336$ and $54$.

Match the following items:
$Q.1.$ $HCF$ of $8$ and $6$ $A. 49$
$Q.2.$ $LCM$ of $(26, 91)$ $B. 182$
$C. 2$

Vedclass Test Series

Exam Paper Generator

Online Exam Module