Use Euclid's division algorithm to find …
CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Posted by Deepak Rathore 6 years, 9 months ago
- 2 answers
Rashmi Bajpayee 6 years, 9 months ago
53124 = 27727 x 1 + 25397
=> 27727 = 25397 x 1 + 2330
=> 25397 = 2330 x 10 + 2097
=> 2330 = 2097 x 1 + 233
=> 2097 = 233 x 9 + 0
Since on finding remainder 0, we have the divisor 233.
Therefore, H.C.F.(53124, 27727) = 233
Related Questions
Posted by Javlina Deka 6 hours ago
- 0 answers
Posted by Mohammad Ramjan 1 day, 4 hours ago
- 1 answers
Posted by Chinmay M.R 20 hours 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
Hans Raj 6 years, 9 months ago
we take 53124 as the dividend and 27727 as the divisor
by Euclid's Div Lemma
53124 = (27727 x 1) + 25397
now we take 27727 as dividend and 25397 as the divisor
27727 = (25397 x 1 ) + 2330
now we take 25397 as dividend and 2330 as the divisor
25397 = (2330 x 10) + 2097
now we take 2330 as the dividend and 2097 as the divisor
2330 = (2097 x 1) + 233
now we take 2097 as the dividend and 233 as the divisor
2097 = (233 x 9 ) + 0
Hence the HCF of 27727 and 53124 is 233
0Thank You