Using Euclid's division algorithm,find the Hi | vedclass

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

Question

(B) To find the $HCF$ of $847$ and $2160$ using Euclid's division algorithm,we perform the following steps:$2160 = 847 	imes 2 + 466$$847 = 466 	ime

Vedclass · Accepted Answer

$1$

Vedclass · Answer

(B) To find the $HCF$ of $847$ and $2160$ using Euclid's division algorithm,we perform the following steps:$2160 = 847 	imes 2 + 466$$847 = 466 	imes 1 + 381$$466 = 381 	imes 1 + 85$$381 = 85 	imes 4 + 41$$85 = 41 	imes 2 + 3$$41 = 3 	imes 13 + 2$$3 = 2 	imes 1 + 1$$2 = 1 	imes 2 + 0$Since the remainder is $0$,the $HCF$ is the divisor at this stage,which is $1$.Two numbers are said to be co-prime if their $HCF$ is $1$. Since the $HCF$ of $847$ and $2160$ is $1$,they are co-prime.

Using Euclid's division algorithm,find the Highest Common Factor $(HCF)$ of the following pair of numbers and determine if they are co-prime:
$847, 2160$

Similar Questions

The value of $\text{g.c.d.}(18, 24) \times \text{l.c.m.}(18, 24) = \dots$

$2.031 \overline{2}$ is ............

For some integer $m$,every even integer is of the form

The $\text{l.c.m.}$ of two numbers is $14$ times their $\text{g.c.d.}$ and the sum of $\text{l.c.m.}$ and $\text{g.c.d.}$ is $600$. If one of the numbers is $280$,then find the other number.

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

Vedclass Test Series

Exam Paper Generator

Online Exam Module

Using Euclid's division algorithm,find the Highest Common Factor $(HCF)$ of the following pair of numbers and determine if they are co-prime:$847, 2160$