As I said, now we know how to solve linear equations simply by using an inversion algorithm to compute a inverse and then multiplying the result by minus B. So the question is what about higher degree polynomials and in particular we are interested in solving, polynomials modulo primes. 