Using Euclid's algorithm. Find the HCF …

CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Posted by Prem Shah 6 years, 7 months ago
- 2 answers
James Darwing 6 years, 7 months ago
Related Questions
Posted by Vanshika Bhatnagar 1 year, 5 months ago
- 2 answers
Posted by Parinith Gowda Ms 4 months, 2 weeks ago
- 1 answers
Posted by Parinith Gowda Ms 4 months, 2 weeks ago
- 0 answers
Posted by Sahil Sahil 1 year, 5 months ago
- 2 answers
Posted by Hari Anand 7 months, 1 week ago
- 0 answers
Posted by Kanika . 2 months ago
- 1 answers
Posted by Lakshay Kumar 1 year, 1 month ago
- 0 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
myCBSEguide
Sia ? 6 years, 7 months ago
Prime factorization:
{tex}144 = 2 ^ { 4 } \times 3 ^ { 2 }{/tex}
{tex}198 = 2 \times 3 ^ { 2 } \times 11{/tex}
HCF = product of smallest power of each common prime factor in the numbers {tex}= 2 \times 3 ^ { 2 } = 18{/tex}
0Thank You