Use euclid's division algorithm, find which …
CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Test
Related Questions
Posted by Parinith Gowda Ms 3 months, 3 weeks ago
- 1 answers
Posted by Kanika . 1 month, 1 week ago
- 1 answers
Posted by Parinith Gowda Ms 3 months, 3 weeks ago
- 0 answers
Posted by Vanshika Bhatnagar 1 year, 4 months ago
- 2 answers
Posted by Lakshay Kumar 1 year, 1 month ago
- 0 answers
Posted by Hari Anand 6 months, 2 weeks ago
- 0 answers
Posted by Sahil Sahil 1 year, 4 months ago
- 2 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 ? 6 years, 5 months ago
{tex}\begin{array}{l}396=231\times1+165\\231=165\times1+66\\165=66\times2+33\\66=33\times2+0\\So\;HCF(396,231)=33\\\end{array}{/tex}
So 33 is common factor of 396 and 231
and co-prime numbers have common factor of 1 only.
∴ The 396 and 231 are not co-prime.
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.
0Thank You