Program to find GCD of two polynomials

The objective is to write a program that finds greatest┬ácommon divisor of two polynomials g(x) and h(x). The task does not define what form we get those two polynomials, so let's say we will get them in a form of a String, something like that: $latex ``2x^3+5x^2+8x+3``$ Let's start splitting our problem into chunks and gather some information about the steps we would need to implement. First, what is the greatest common divisor? In math, GCD of two or more integers, which are not all zero, is the largest positive…

Continue Reading

End of content

No more pages to load

Close Menu