No products in the cart.

Using Euclid's Division Algorithm Prove that …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

Using Euclid's Division Algorithm Prove that 847,2160 are co-prime number
  • 1 answers

Sia ? 4 years, 6 months ago

Co-primes are 2 numbers which have only one as a common factor.
a = 2160
b = 847
By Euclid's lemma a=bq+r,  0≤r<b                                   

2160 = 847 × 2 + 466
847 = 466 × 1 + 381
466 = 381 × 1 + 85
381 = 85 × 4 + 41
85 = 41 × 2 + 3
41 = 3 × 13 + 2
3 = 2 × 1 + 1
2 = 1 × 2 + 0

As 1 is the HCF of 847 and 2160.
∴ 847 and 2160 are co-primes as they have only 1 as their HCF.

http://mycbseguide.com/examin8/

Related Questions

sin60° cos 30°+ cos60° sin 30°
  • 2 answers
(A + B )²
  • 1 answers
Prove that root 8 is an irration number
  • 2 answers
Venu Gopal has twice
  • 0 answers
X-y=5
  • 1 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