2 thoughts on “find hcf by euclid division lamma method with divid 867and 255”
:Concept
[tex]\mapsto[/tex] Euclid’s Division Lemma states that, if two positive integers “a” and “b”, then there exists unique integers “q” and “r” such that which satisfies the condition a = bq + r where 0 ≤ r ≤ b.
[tex] \looparrowright[/tex]A/q 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
[tex] \looparrowright[/tex]a = bq + r where 0 ≤ r < b
[tex] \looparrowright[/tex]Consider two numbers 867 and 255, and we need to find the HCF of these numbers.
[tex]\mapsto[/tex] 867 is grater than 255, so we will divide 867 by 225
: Concept
[tex]\mapsto[/tex] Euclid’s Division Lemma states that, if two positive integers “a” and “b”, then there exists unique integers “q” and “r” such that which satisfies the condition a = bq + r where 0 ≤ r ≤ b.
[tex] \looparrowright[/tex]A/q 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
[tex] \looparrowright[/tex]a = bq + r where 0 ≤ r < b
[tex] \looparrowright[/tex]Consider two numbers 867 and 255, and we need to find the HCF of these numbers.
[tex]\mapsto[/tex] 867 is grater than 255, so we will divide 867 by 225
[tex] \looparrowright[/tex]867 = 255 × 3 + 102
[tex] \implies[/tex]Now lets divide 255 by 102
[tex] \looparrowright[/tex] 255 = 102 × 2 + 51
[tex]\mapsto[/tex] Now divide 102 by 51
[tex]\mapsto[/tex] 102 = 51 × 2 + 0
[tex] \looparrowright[/tex]Here reminder is zero.
[tex]\mapsto[/tex] HCF of (867, 255) = 51
Answer:
B
Step-by-step explanation:
Hence by Euclid’s division algorithm, 51 is the HCF of 867 and 255. Hence option (B). 51 is the correct answer.