Banner 0
Banner 1
Banner 2
Banner 3
Banner 4
Banner 5
Banner 6
Banner 7
Banner 8
Banner 9

Q.


The H.C.F of 867 and 255 using Euclid’s division algorithm is ____

see full answer

Your Exam Success, Personally Taken Care Of

1:1 expert mentors customize learning to your strength and weaknesses – so you score higher in school , IIT JEE and NEET entrance exams.
An Intiative by Sri Chaitanya

(Unlock A.I Detailed Solution for FREE)

Best Courses for You

JEE

JEE

NEET

NEET

Foundation JEE

Foundation JEE

Foundation NEET

Foundation NEET

CBSE

CBSE

Detailed Solution


The H.C.F of 867 and 255 using Euclid’s division algorithm is 51.
Given two numbers are 867 and 255.
We have to find the H.C.F of both numbers using Euclid’s division algorithm.
According to Euclid’s division lemma, the relation of a and b is
a=bq+r   where a and b are positive integers, r = remainder and q = quotient.
Since 867>255, a = 867 and b = 255.
867=255×3+102  
Since, the remainder is not 0,
a = 255 and b = 102.
255 = 102×2 +51   Since, the remainder is not 0,
a = 102 and b = 51.
102 = 51 ×2 + 0
Now, the remainder is 0, so H.C.F. is 51.
H.C.F of 867 and 255 is 51.
 
Watch 3-min video & get full concept clarity
score_test_img

courses

No courses found

Ready to Test Your Skills?

Check your Performance Today with our Free Mock Test used by Toppers!

Take Free Test

Get Expert Academic Guidance – Connect with a Counselor Today!

best study material, now at your finger tips!

  • promsvg

    live classes

  • promsvg

    progress tracking

  • promsvg

    24x7 mentored guidance

  • promsvg

    study plan analysis

download the app

gplay
mentor

Download the App

gplay
whats app icon
personalised 1:1 online tutoring