Browse by Stream
QnA
Home
QnA
Go To Your Study Dashboard

Get Answers to all your Questions

header-bg qa
  • Home
  • School
  • Use Euclid’s division algorithm to find the HCF of 255 and 867.  

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

 

Answers (1)

Euclid’s division algorithm \Rightarrow HCF\left ( a,b \right )= HCF\left ( d,r \right )
where a,b are no's of when HCF to be calculated d is division ; r is remainder
Step -1 \rightarrow Since 867> 255, apply division lemma to get
                    867= 255\times 3+102
Step-2 \rightarrow As\, 102\neq 0 hence we apply division lemma on d, r to get
                   255= 102\times 2+51
step -3 \rightarrow As\, 51\neq 0 hence we apply division lemma on d, r to get
                  102= 51\times 2+0
Now the remainder , r = 0
Hence, we get the HCF as the new diviser which is 51
\Rightarrow HCF\left ( 255,867 \right )= 51

Posted by

Safeer PP

View full answer

Similar Questions

Trending Articles/News

anam-khan

CBSE Class 10, 12 syllabus 2024-25 out; board restores two-level mathematics rule
anam-khan

CBSE Class 10 board exam 2024 passing criteria, eligibility for compartment; all you need to know

Latest Question