Question

Zula is trying to find the highest common factor of 656565 and 117117117 using Euclid's Division Algorithm (\text{EDA})(EDA)left parenthesis, start text, E, D, A, end text, right parenthesis.
In her 3^{\text{rd}}3
rd
3, start superscript, start text, r, d, end text, end superscript step, she gets a divisor of 131313.
Find the remainder at the end of 3^{\text{rd}}3
rd
3, start superscript, start text, r, d, end text, end superscript step.
7
8
9
4
5
6
1
2
3
0​

Answer 1

Ur question is not clear. Pls type it correctly