4052 and 12579 division algorithm
CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Posted by Sakshi Madheshiya 4 years, 2 months ago
- 1 answers
Related Questions
Posted by Lakshay Kumar 10 months, 2 weeks ago
- 0 answers
Posted by Vanshika Bhatnagar 1 year, 2 months ago
- 2 answers
Posted by Kanika . 1 month, 4 weeks ago
- 1 answers
Posted by Parinith Gowda Ms 1 month ago
- 1 answers
Posted by Sahil Sahil 1 year, 2 months ago
- 2 answers
Posted by Parinith Gowda Ms 1 month ago
- 0 answers
Posted by Hari Anand 3 months, 4 weeks 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
Sia ? 4 years, 2 months ago
According to Euclid’s Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b.
HCF is the largest number which exactly divides two or more positive integers.
Since 12576 > 4052
12576 = (4052 × 3) + 420
420 is a reminder which is not equal to zero (420 ≠ 0).
4052 = (420 × 9) + 272
271 is a reminder which is not equal to zero (272 ≠ 0).
Now consider the new divisor 272 and the new remainder 148.
272 = (148 × 1) + 124
Now consider the new divisor 148 and the new remainder 124.
148 = (124 × 1) + 24
Now consider the new divisor 124 and the new remainder 24.
124 = (24 × 5) + 4
Now consider the new divisor 24 and the new remainder 4.
24 = (4 × 6) + 0
Reminder = 0
Divisor = 4
HCF of 12576 and 4052 = 4.
3Thank You