Using Euclid's Division Algorithm Prove that …
CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Posted by Vivek Gahlot 4 years, 6 months ago
- 1 answers
Related Questions
Posted by Vanshika Bhatnagar 1 year, 2 months ago
- 2 answers
Posted by Parinith Gowda Ms 1 month, 1 week ago
- 0 answers
Posted by Sahil Sahil 1 year, 2 months ago
- 2 answers
Posted by Parinith Gowda Ms 1 month, 1 week ago
- 1 answers
Posted by Lakshay Kumar 10 months, 3 weeks ago
- 0 answers
Posted by Hari Anand 4 months ago
- 0 answers
Posted by Kanika . 2 months ago
- 1 answers
myCBSEguide
Trusted by 1 Crore+ Students
Test Generator
Create papers online. It's FREE.
CUET Mock Tests
75,000+ questions to practice only on myCBSEguide app
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.
1Thank You