web analytics

Example 1 - Use Euclid’s algorithm to find HCF of 4052 - HCF using Euclid's Division Algorithm

  1. Chapter 1 Class 10 Real Numbers
  2. Serial order wise
Ask Download

Transcript

Example 1 Use Euclid’s algorithm to find the HCF of 4052 and 12576. Since 12576 > 4052, We divide 12576 by 4052 Since remainder is not 0 We divide 4052 by 420 Since remainder is not zero 0 We divide 420 by 272 Since remainder is not zero 0 We divide 272 by 148 Since remainder is not zero We divide 148 by 124 Since remainder is not zero We divide 124 by 24 Since remainder is not zero We divide 24 by 4 Since remainder is 0 HCF of 12576 and 4052 is 4

About the Author

Davneet Singh's photo - Teacher, Computer Engineer, Marketer
Davneet Singh
Davneet Singh is a graduate from Indian Institute of Technology, Kanpur. He provides courses for Mathematics from Class 9 to 12. You can ask questions here.
  • Ravi Tiwari's image
    Sir 
    Please can you explain maths ncert book page 2 Euclid's explaining about eggs in last how they took out 119 eggs I am very confused in that qus even I asked my teachers but they were notable to explain

                   Thanks

    IMG_20170614_024523.jpg

    IMG_20170614_024516.jpg

    View answer
Jail