Find the HCF of 275 and 363 by using Euclid’s division algorithm. 

As 363 > 275, apply Euclid’s division lemma to the numbers 363 and 275. We obtain 

363 = 275 × 1 + 88 

As the remainder 88 ≠ 0, apply Euclid’s division lemma again to the numbers 275 and 88. We obtain 

275 = 88 × 3 + 11 

Again, as the remainder 11 ≠ 0, apply Euclid’s division lemma again to the numbers 88 and 11. We obtain 

88 = 11 × 8 + 0 

The remainder here is 0 and the divisor is 11. 

Hence, HCF (363, 275) = 11