Tuesday, 9 April 2013

gcd and lcm - GCD of X4+5X3+3X2+X and X2+1 ( Euclidean Algorithm + Finding the inverse of the polynomial)



It is obvious the GCD of those two is 1.



The thing that makes me post this question is that why when using Euclidean Algorithm the GCD seems to be 54 ?



I want furthermore to find the inverse of the polynomial and i know i can do that when the GCD = 1 by using Extended Euclidean Algorithm. Yet as i've said i have 5/4.


Answer



So what? The conclusion (assuming that the computations are correct) is that 54 is a GCD of your polynomials. This is the same thing as saying that they are relatively prime.



No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...