☰
✕

Real Numbers
Question
Wired Faculty App

Using Euclid's division algorithm, find the HCF of 56, 96 and 404.

Answer

I. By using Euclid's Division Algorithm, we have

II. Again, we apply division algorithm on divisor 56 and remainder 40, we get

III. Again, we apply division algorithm on divisor 40 and remainder 16, we get

IV. Again, we apply division algorithm on divisor 16 and remainder 8, we get

Now, HCF (56, 96)= 8

Applying Euclid’s division algorithm on 8 and 404, we get

Now, HCF (404, 8) = 4

Hence, H.C.F. of 56, 96 and 404 is 4. Ans.

Problems Based on Fundamental theorem of Arithmetic

Sponsor Area

Some More Questions From Real Numbers Chapter

Express each number as a product of its prime factors:  (v) 7429

Find the LCM and HCF of the following pairs of integers and verify that LCM × HCF = product of the two numbers. (i) 26 and 91

Find the LCM and HCF of the following pairs of integers and verify that LCM × HCF = product of the two numbers.  (ii) 510 and 92 

Find the LCM and HCF of the following pairs of integers and verify that LCM × HCF = product of the two numbers.  (iii) 336 and 54

Find the LCM and HCF of the following integers by applying the prime factorisation method. (i) 12, 15 and 21 

Find the LCM and HCF of the following integers by applying the prime factorisation method. (ii) 17, 23 and 29 

Find the LCM and HCF of the following integers by applying the prime factorisation method. (iii) 8, 9 and 25

Check whether 6n can end with the digit 0 for any natural number n

Explain why 7 × 11 × 13 + 13 and 7 × 6 × 5 × 4 × 3 × 2 × 1 + 5 are composite numbers.