1. Use the Euclidean algorithm to find greatest common divisor of f (x) = x^4 + 7 x^2 + 1 and g (x) = x^5 + 2, considered as polynomials in F_3 [x]. Express gcd(f, g) as a combination of f and g. 2. ...
USA.). The maximum search depth for the search algorithm was set to 15, with a beam size of 20, and a timeout of 600 s for each problem. The entire experiment lasted approximately one day under multi-process handling. For the solving methods and strategies employed by FGeo-TP, we empl...