Question

EXERCISE 3.4
Use Cordova Smart Class Software on the smart board in class to do Exer
nd the H.C.F. of the following using prime factorisation method :
1. 170, 238
2. 272, 425
3. 18, 24, 32
9. 91, 175, 49
5. 924, 1463, 1925
6. 150, 140, 210
. 396, 720, 1080
8. 144, 252, 630
9. 1440, 1800, 1920
72, 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 ha
ess of prime factorisation becomes tedious and time consuming. Euclid, a Greek
thod to find H.C.F. of two or more than two numbers. This method is known as
division 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 1

Plz Send It Properly...

I'm Not Able To Understand Anything...

And It's Too Long Also..

XD