Gapplet

Given polynomials f, g Q[X], run the extended Euclidean algorithm to determine their extended gcd.

Input f,  e.g., X^14+2*X-3
</COMMENT>
Input g,  e.g., 2/3*X^7-2/3*X-3
</COMMENT>
 
initial step
</COMMENT>
 
</COMMENT>
 
 
looping
</COMMENT>
 
</COMMENT>