☰
✕

Real Numbers
Question
Wired Faculty App

Use Euclid’s division algorithm to find the HFC of 867 and 255

Answer

Given integers are 867 and 255.

Clearly 867 > 255

Therefore, by applying Euclid’s division lemma to 867 and 255, we get

II.  Since the remainder 102 ≠ 0, we apply division lemma to get,

III. We consider the new divisor 102 and new remainder 51 and apply division lemma to get,


The remainder at this step is zero. So, the divisor at this stage or the remainder at the previous stage i.e., 51 is the HCF of 867 and 255.

Sponsor Area

Some More Questions From Real Numbers Chapter

Express each number as a product of its prime factors: (ii) 156 

Express each number as a product of its prime factors: (ii) 156 (iii) 3825 (iv) 5005 (v) 7429

Express each number as a product of its prime factors: (iv) 5005 

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