If HCF(f,g)=1 then exists two polynomials such as
In this case, applying Euclid's algorithm, we have:
Plug in (1) and we have
Divide by -2:
Now, for we have
the HCF(f, g) = 1.
but is there a special way to do this kind of question... or do i have to compute manually by long division?
now let satisfy .
Find a,b,c,d such that :
any clue on how to go about with this one please? ill try it out for myself once i have an idea on what route to follow?
thnx a great deal guys