Question

Kanta is trying to find the highest common factor of 424242 and 455455455 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 777.
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:

use Euclid algorithm can be used

Explanation:

no in division only 0 should be in the end