Talk:Extended Euclidean algorithm/to do

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
  • Finish the section "Proof" : add the proof of the bound on Bézout's coefficients. D.Lazard (talk) 23:30, 3 November 2013 (UTC)[reply]
  • Add inline references to Knuth, The Art of Computer programming D.Lazard (talk) 23:30, 3 November 2013 (UTC)[reply]
  • Add section "Polynomial Extended Euclidean algorithm". D.Lazard (talk) 23:30, 3 November 2013 (UTC)[reply]
 Done D.Lazard (talk) 11:01, 4 November 2013 (UTC)[reply]
  • Rename the section "Formal description of the algorithm" to "Pseudocode" and clean it up. D.Lazard (talk) 23:30, 3 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]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Extended_Euclidean_algorithm/to_do&oldid=580467626"