Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Use Euclid’s division algorithm to find the HCF of 867 and 255
867 can be written in multiples of 255 as below. 867 = 255 * 3 + 102 255 = 102 * 2 + 51 102 = 51 * 2 + 0 As you can see the remainder has become zero now and the highest common factor is 51.
867 can be written in multiples of 255 as below.
867 = 255 * 3 + 102
255 = 102 * 2 + 51
102 = 51 * 2 + 0
As you can see the remainder has become zero now and the highest common factor is 51.
See lessUse Euclid’s division algorithm to find the HCF of 135 and 225
225 = 135*1+90 135=90*1+45 90=45*2+0 Therefore HCF is 45
225 = 135*1+90
135=90*1+45
90=45*2+0
Therefore HCF is 45
See lessUse Euclid’s division algorithm to find the HCF of 196 and 38220
According to Euclid's theorem x = y*q + r. 38220 = 196×195 + 0 So the HCF is 196.
According to Euclid’s theorem x = y*q + r.
38220 = 196×195 + 0
So the HCF is 196.
See less