1 / 10

By..Ms.Patsara Aroonmeesri

Euclid’s Theorem. For M.1. By..Ms.Patsara Aroonmeesri. Kumphawapi School. Find The Highest Common Factor ( HCF ) by Euclid’s Theorem. Step I :. Divide the larger number by the small number. Step II :. Divide the small number by the remainder. Step III :.

abram
Download Presentation

By..Ms.Patsara Aroonmeesri

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Euclid’s Theorem For M.1 By..Ms.Patsara Aroonmeesri Kumphawapi School

  2. Find The Highest Common Factor ( HCF ) by Euclid’s Theorem Step I : Divide the larger number by the small number. Step II : Divide the small number by the remainder. Step III : Donot stop dividing until you get zero(0) remainder. Step IV : The divisor that give you zero(0) remainder is consider as your HGF.

  3. Forexample the larger number the small number the remainder Find HCF of 32,48 by Euclid’s Theorem Step I : Divide the larger number by the small number. 1 32 48 32 16 The remainder in step I is 16. And the small number is 32. Next,you must to divide 32 by 16 in step II

  4. the small number in step I -the remainder in step I -the divisor in step II the remainder Step II : Divide the small number by the remainder. 2 16 32 32 0 The remainder in step II is zero (0). You must to stop dividing. Thus,the HCF of 32,48 is 16.

  5. -the remainder in step III -the divisor in step IV the remainder Example II Find HCF of 744,1044 by Euclid’s Theorem Step II Step III Step I 2 2 1 144 300 300 744 744 1044 288 600 744 12 144 300 Step IV 2 1 12 144 12 4 2 Thus,the HCF of 744,1044 is 24 12 0

  6. Forexample the larger number the small number the remainder Find HCF of 32,48 by Euclid’s Theorem Step I : Divide the larger number by the small number. 32 48 1 32 16 The remainder in step I is 16. And the small number is 32. Next,you must to divide 32 by 16 in step II

  7. the small number the remainder in step I the remainder in step II Step II : Divide the small number by the remainder. 32 48 1 2 32 32 0 16 The remainder in step II is zero (0). You must to stop dividing. Thus,the HCF of 32,48 is 16.

  8. Thus,the HCF of 744,1044 is Example II Find HCF of 744,1044 by Euclid’s Theorem Step I 1044÷744 Step II 744÷300 2 744 1044 1 Step III 300 ÷144 744 600 Step IV 144 ÷12 2 12 300 144 288 144 0 12 12

  9. Exercise: Find HCF of following by Euclid’s Theorem 6.) 312,975 1.) 18,24 7.) 708,813 2.) 32,80 3.) 42,54 8.) 744,1044 4.) 45,90 9.) 6,16,24 10.) 492,744,1044 5.) 44,66

  10. Bye Bye Thanks for learning.

More Related