Use Euclid’s division algorithm to find the HCF of 255 and 867.
Euclid’s division algorithm
where a,b are no's of when HCF to be calculated d is division ; r is remainder
Step -1 Since apply division lemma to get
Step-2 hence we apply division lemma on d, r to get
step -3 hence we apply division lemma on d, r to get
Now the remainder , r = 0
Hence, we get the HCF as the new diviser which is 51