No products in the cart.

Using Euclid division algorithm find whether …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

Using Euclid division algorithm find whether the pair of numbers 847,2160 are co prime or not?
  • 1 answers

Sia ? 6 years, 6 months ago

Here we have to find out HCF of 2160 and 847 by Using Euclid’s division Lemma, we get
2160 = 847{tex}\times{/tex}2 + 466
Also 847 = 466{tex}\times{/tex}1 + 381
466 = 381{tex}\times{/tex}1 + 85
381 = 85{tex}\times{/tex}4 + 41
85 = 41{tex}\times{/tex}2 + 3
41=3{tex}\times{/tex}13 + 2
3 = 2{tex}\times{/tex}1 + 1
2 = 1{tex}\times{/tex}2 + 0
{tex}\therefore{/tex}HCF = 1.
Hence the numbers are co-prime.

https://examin8.com Test

Related Questions

Find the nature of quadratic equation x^2 +x -5 =0
  • 0 answers
Prove that root 8 is an irration number
  • 2 answers
X-y=5
  • 1 answers
sin60° cos 30°+ cos60° sin 30°
  • 2 answers
(A + B )²
  • 1 answers
Venu Gopal has twice
  • 0 answers

myCBSEguide App

myCBSEguide

Trusted by 1 Crore+ Students

Test Generator

Test Generator

Create papers online. It's FREE.

CUET Mock Tests

CUET Mock Tests

75,000+ questions to practice only on myCBSEguide app

Download myCBSEguide App