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

$\frac{47}{500}$ has $\ldots$ digits after the decimal point in its terminating decimal expansion.

Prove that $\sqrt{7}$ is an irrational number.

If the greatest common divisor (g.c.d.) of $a$ and $b$ is $d$,then which of the following statements is false?

Find the smallest five-digit number which is exactly divisible by $15$,$55$,and $99$.

Find the square root of $8+\sqrt{63}$ in the form of a binomial surd.

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$