Ouch, that sounds painful!! If it is any consolation, I hurt my knee after attempting a move called a cork. I came close .... too close .... to the ground .... then thwack. It'll recover, but it is a bit sore.
For extended GCD there is a description of an algorithm on page 464 of Crandall and Pomerance "Primes: a computational perspective" due to Penk which outlines how to get a binary extended GCD algorithm. In Stehle and Zimmermann's paper there is a description of an asymptotically fast binary recursive GCD algorithm. There's also a paper of Cesari 1998 on the same topic. Basically we can do a similar sort of thing for Moller's ngcd function. It's relatively straightforward - should be only about half a page of code. Might make a nice project for someone. I originally volunteered to do it, but at present haven't found time to get it done. Bill. 2009/1/19 mabshoff <michael.absh...@mathematik.uni-dortmund.de>: > > > > On Jan 18, 6:25 pm, Bill Hart <goodwillh...@googlemail.com> wrote: > > Hi, > >> As mentioned before, there is no LGPL Moller patch for xgcd. We have >> to write one. > > Ok, I should know that by now. I am a little loopy due to pain killers > after tearing open my hand due to me hitting the pavement. I will > survive and I am leaving for SD 12 in about a day, so I have been > merging things up into Sage 3.3.alpha0 since it needs to be out before > Monday morning PST. > >> Bill. > > Cheers, > > Michael > > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to mpir-devel@googlegroups.com To unsubscribe from this group, send email to mpir-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en -~----------~----~----~----~------~----~------~--~---
