0

.I have been trying it for more time but not getting how to solve the polynomial equation after converting from base 'b' to decimal i.e. my algorithm is:-

size of array = max(A.size(),B.size(),Z.size());

store A in array as int;

add B as int element by element;

subtract Z as int element by element;

now we get cofficients of a polynomial in b i.e x1*b^n + x2*b^(n-1) + ...... + xn*b^0 = 0;

How to solve it or is there any other method for it??

Thanks in advance.