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. ...
Geometry3K dataset in Inter-GPS did not have manually annotated theorem sequences required for solving problems. Instead, they were randomly sampled, leading to potentially non-optimal theorem sequences. Furthermore, it could only predict theorems for 1500 questions and not for all questions in the...