Using euclid's division algorithm find HCF of 126 and 1076.
Answers
Answered by
3
Answer:
refer the attachment
FOLLOW me if you liked my ANSWER or mark me as BRAINLIEST
Attachments:
Answered by
1
Answer:
HCF(126,1076)=2
Step-by-step explanation:
Euclid's division algorithm is a=b*q+r, a bigger than b,
r≤0
1076=126*8+68
126=68*1+58
68=58*1+10
58=10*5+8
10=8*1+2
8=2*4+0
Therefore, HCF(126,1076)= 2
Similar questions