Talk:Extended Euclidean algorithm/to do

Latest comment: 10 years ago by D.Lazard
 Done D.Lazard (talk) 11:01, 4 November 2013 (UTC)Reply
 Done D.Lazard (talk) 15:27, 4 November 2013 (UTC)Reply
  • Rename section "Computing a multiplicative inverse in a finite field" as "Computing modular inverse" and include in it inverse modulo an integer and inverse in an algebraic field extension, including inverse in a finite field of non-prime order. D.Lazard (talk) 23:30, 3 November 2013 (UTC)Reply
 Done D.Lazard (talk) 16:08, 6 November 2013 (UTC)Reply