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
Answers
Answered by
62
Step-by-step explanation:
Q:-solve and verify the equation
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _✍️
══════════XXX═════════════
cancelling 6( R.H.S) By 3 From L.H.S
CHECK:-
THEREFORE,L.H.S=R.H.S
VERIFIED✔️
══════════XXX═════════════
HOPE IT HELPS YOU..
_____________________
Thankyou:)
Similar questions