Use euclid division algorithm to find the HCF of 867 and 255
Answers
Answered by
0
after dividing the integers:
divident = divisor * quotient + remainder.
step 1: 867 = 255 * 3 + 102
step 2: 255 = 102 * 2 + 51
step 3: 102 = 51 * 2 + 0
thus the H.C.F is the last divisor ,, i.e, 51
divident = divisor * quotient + remainder.
step 1: 867 = 255 * 3 + 102
step 2: 255 = 102 * 2 + 51
step 3: 102 = 51 * 2 + 0
thus the H.C.F is the last divisor ,, i.e, 51
baabu143pau:
plz mark as brainliest
Answered by
0
Step-by-step explanation:
Hope it helps...
mark me as Brainlist
Attachments:
Similar questions