From: fateman@cs.berkeley.edu   
      
   On 7/6/2017 3:29 PM, bursejan@gmail.com wrote:   
   > Knuth is kind of a methusalem reference for GCD, his 2nd   
   > vol is from 1969, he even doesn't mention GCD via GB.   
      
   While the connection between GB and GCD probably goes   
   back to the first GB papers,  I am not aware of anyone other   
   than you who has proposed to implement a GCD by running   
   a GB algorithm.  Probably because, on the face of it, it   
   seems so inefficient.  And making a Prolog run faster   
   doesn't change that.   
      
   >   
   > His more expanded algorithms E and C only work for   
   > univariate polynomials, the rest is references to secondary   
      
   I don't have the book here at home, but I seem to recall   
   that (perhaps in an exercise) he indicates that they can be   
   used for multivariate polynomials.  Which they obviously   
   can.  In Maxima,  gcd:mod  uses essentially the algorithm   
   in Knuth.  That is not a recommended setting.   
   >   
   > work. BTW: Integer GCD is also fun, I am using a binary   
   > integer GCD, respectively Java had it, and I needed to   
   >   
   > replicate some of the code, for my Prolog ALU:   
   > https://github.com/jburse/jekejeke-devel/blob/master/jekmin/he   
   dless/jekmin/reference/misc/SupplementElem.java#L161   
      
      
   That is a different topic.  I find it hard to believe that you "needed"   
   a binary GCD, as opposed to the usual iterative one.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)