Question

find the HCF of 867 and 255 by using euclid's algorithm. Please do with method and steps​

Answer 1

According to Euclid’s Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition

a = bq + r where 0 ≤ r < b

Consider two numbers 867 and 255, and we need to find the HCF of these numbers.

867 is grater than 255, so we will divide 867 by 225

867 = 255 × 3 + 102

Now lets divide 255 by 102

⇒ 255 = 102 × 2 + 51

Now divide 102 by 51

⇒ 102 = 51 × 2 + 0

Here reminder is zero.

∴ HCF of (867, 255) = 51

Answer 2

Answer:

EDL means Euclid division lemma or algorithm so it is written in short from in question so don't get confused.