(defn ack [m n] (if (= m 0) (inc n) (if (= n 0) (ack (dec m) 1) (ack (dec m) (ack m (dec n))))))

# Author: User

## VU PKI 2018

**Algoritmai ir duomenų struktųros**

Algorithms (Fourth Edition, Princeton Un.)

Duomenų struktūros ir algoritmai (A.Juozapavičius)

**Diskrečioji matematika**

Logika ir dirbtinis intelektas (S. Norgela)

## 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:

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 integer that divides each of the integers* (1).

How do we find it? One way is to use the Euclidean algorithm. The intuition behind this algorithm is such: we have A and B numbers. We divide A by B and get C. If C is 0 – then B is our GCD. If it is not 0, then we set A to B and B to the reminder and continue operation until we get 0.

Let’s say we have 12 and 9. 12 mod 9 is 3. 9 mod 3 is 0. So our GCD is 3.

Ok, now we know about GCD and Euclidian algorithm. Next topic – Polynomials.

Polynomial is an expression consisting of variables (x,y,z etc) and coefficients, that involves only operations of addition, subtraction, and non-negative exponents of variables.

Example of a polynomial with single indeterminate ( variable ) x is

An example in three variables is

Our objective states to find GCD of g(x) and h(x) polynomials, so we assume objective is to find GCD of single variable polynomials.

Also, for the sake of simplicity, we could say that polynomial consists of a list of monomials with the same variable. Each monomial is made of an optional coefficient, optional variable with optional non-negative integer exponent.

So in we have list of monomials , and .

Now we have defined GCD and polynomials. But can we apply the Euclidean algorithm to find GCD for Polynomials? And the short answer is yes.

We will supose that *deg(g(x)) <= deg(h(x))*.

Then we find two polynomials q(x) and r(x) that satisfy:

Where q is quotient and r is reminder.

Then we set and .

And we repeat polynomial long division to get now polynomials and so on until we reach point when we get .

Lets conclude what we knwo at this point: we know what is GCD, we know abut Euclidean algorithm to find GCD, we know about polynomials and monomials and we know that we can apply Euclidean algorithm to find GCD for polynomials.

There are some things to find out though. When applying the Euclidean algorithm to polynomials we use Polynomial long division for dividing a polynomial by a polynomial of the same or lower degree.

We will have to implement this either to get our quotient and remainder of the polynomial division.

- divide the first term of the dividend by the highest term of the divisor
- multiply the divisor by the result just obtained
- subtract the product just obtained from the appropriate terms of original dividend
- repeat the previouss three steps except this time use the two terms that have just been written as the dividend.

Example:

Divide

**Step 1.** Make sure polynomial is written in descending order. If any term missing, use a zero to fill in the missing term. In this case we should get:

**Step 2.** Divide the term with the highest power inside the division symbol by the term with the highest power outside the division symbol. It his case, we have divided by which is .

**Step 3.** Multiply the answer obtained in the previous step by the polynomial in front of the division symbol. In this case we need to multiply 3x and x^2 – 1.

**Step 4**: Subtract and bring down the next term.

**Step 5**: Divide the term with the highest power inside the division symbol by the term with the highest power outside the division symbol. In this case, we have –2x^{2} divided by x^{2} which is –2.

**Step 6**: Multiply (or distribute) the answer obtained in the previous step by the polynomial in front of the division symbol. In this case, we need to multiply –2 and x^{2} – 1.

**Step 7**: Subtract and notice there are no more terms to bring down.

The polynomial above the bar is the quotient *q*(*x*), and the number left over (3x+4) is the remainder *r*(*x*).

*If A* = *BQ* + *R then*

**Step 8**: Write the final answer. The term remaining after the last subtract step is the remainder and must be written as a fraction in the final answer.

i.e.

(Example is taken from here )

Looking at those steps we can see that we will need to implement those primitive steps in our application:

- Polynomial sort by exponents.
- Polynomial missing term expansion.
- Monomial division.
- Monomial multiplication.
- Monomial subtraction.

So now: we know what is GCD, we know about Euclidean algorithm to find GCD, we know about polynomials and monomials and we know that we can apply Euclidean algorithm to find GCD for polynomials and then we know how to perform long division on polynomials.

At this point we have enough information and can start writing some code.