Am Freitag, 7. Juli 2017 23:38:27 UTC+2 schrieb Richard Fateman:   
   > in order to do the (pseudo) division to find the (pseudo) remainder,   
   > we multiply f  by the leading coefficient of g,  which is y^2, raised   
   > to the power of 1+ the difference in degrees of f and g.  Thus we divide   
   > new f   is  (y^2)^2*f =  y^6*x^2 - y^5*x.   
      
   Here you are already half way in Gröbner Base algorithms,   
   S-polynomials, which is not an Euclidean algorithm. BTW    
   Monomial wise max degree of f and g is the same.   
      
   So the alternative hypothesis is that you don't have a bird   
   brain, but that you are just not aware of what you are doing.   
   Maybe you are too casual about the whole matter.   
      
   That would also explain why you deposited your conjecture.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)