Computing a GCD of Two Polynomials
Vložit
- čas přidán 26. 04. 2023
- s23 math 302 quiz 12 problem 01
We compute a GCD of two polynomials over ℚ in two ways. First, we compute it using the Euclidean algorithm. Second we compute it by factoring the two polynomials and taking the minimum exponent of each irreducible factor. - Hry