Question

Rina is trying to find the highest common factor of 418418418 and 333333 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 111111.
Find the remainder at the end of 3^{\text{rd}}3
rd
3, start superscript, start text, r, d, end text, end superscript step.

Answer 1

Answer:

I don't know the answer of this question