Saved Bookmarks
| 1. |
EXERCISE 3.4Use Cordova Smart Class Software on the smart board in class to do Exernd the H.C.F. of the following using prime factorisation method :1. 170, 2382. 272, 4253. 18, 24, 329. 91, 175, 495. 924, 1463, 19256. 150, 140, 210. 396, 720, 10808. 144, 252, 6309. 1440, 1800, 192072, 108, 180.Find H.C.F. by Division Method (Euclid's Algorithm)process of prime factorisation to find H.C.F. is convenient and easier but if we haess of prime factorisation becomes tedious and time consuming. Euclid, a Greekthod to find H.C.F. of two or more than two numbers. This method is known asdivision method for finding H.C.F. of numbers.for finding H.C.F. (Euclid's Algorithm) :1 : Identify the greater number.: : Take the greater number as dividend and the smaller number as divisor.Find HCF using prime factorisation method 924,1463,1925 |
|
Answer» Plz SEND It Properly... I'm Not Able To Understand Anything... And It's Too LONG Also.. XD |
|