The Euclidean algorithm can be used to solve linear Diophantine equations and Chinese remainder problems for polynomials; continued fractions of polynomials can also be defined.
Algorithme euclidien adobat adiqil amitkalan fal adiqin alɣisaban dioɗhantienne anilkamnen əd aśibaban wi daqimanen ən chinois fal polynômetan ; fractiontan okaynen dǎɣ polynômetan adobatnen deɣqanen eqalan atiwalaɣen.