Daily Maths Challenges
siriusmart
•
3mo ago
•
100%
[2024/08/04] Extended Euclid's Algorithm
- Given
n
andm
are coprime, show that there exist integern'
such thatnn' mod m=1
. - The extended Euclid's algorithm is given below without proof, which may be useful in your proof.
(I'm too lazy to type out the algorithm again, so look at the image yourself)
Comments 1