Greatest common divisor of polynomials

In summary, the conversation discusses finding the greatest common divisor of two polynomials in different forms. The Euclidean algorithm is used to determine the factors and it is found that the g.c.d. is equal to 1. However, if the polynomials are considered in the form of integer modulo 2, the g.c.d. is found to be 1 + x + x^2.
  • #1
evinda
Gold Member
MHB
3,836
0
Hello! :cool:

I want to find the greatest common divisor of $x^4+1$ and $x^2+x+1$.
I applied the Euclidean division and found that $x^4+1=(x^2+x+1) \cdot (x^2-x)+(x+1)$.
So,isn't it like that: $gcd(x^4+1,x^2+x+1)=x+1$ ?
But.. in my textbook,the result is $1$! Which of the both results is right?? (Blush) :confused: (Thinking)
 
Physics news on Phys.org
  • #2
You did not finish the Euclidean algorithm, which consists of several Euclidean divisions.
 
  • #3
Evgeny.Makarov said:
You did not finish the Euclidean algorithm, which consists of several Euclidean divisions.

Oh,yes!You are right! (Giggle) I found now that the greatest common divisor is equal to $1$! Thank you! :)
 
  • #4
evinda said:
Hello! :cool:

I want to find the greatest common divisor of $x^4+1$ and $x^2+x+1$.
I applied the Euclidean division and found that $x^4+1=(x^2+x+1) \cdot (x^2-x)+(x+1)$.
So,isn't it like that: $gcd(x^4+1,x^2+x+1)=x+1$ ?
But.. in my textbook,the result is $1$! Which of the both results is right?? (Blush) :confused: (Thinking)

If they are 'ordinary polynomials' then their factorisations are...

$\displaystyle 1 + x^{4} = (x - e^{i\ \frac{\pi}{4}})\ (x - e^{- i\ \frac{\pi}{4}})\ (x - e^{i\ \frac{3\ \pi}{4}})\ (x - e^{- i\ \frac{3\ \pi}{4}})$

$\displaystyle 1 + x + x^{2} = (x - e^{i\ \frac{2\ \pi}{3}})\ (x - e^{- i\ \frac{2\ \pi}{3}})$

... and the two polynomial have no common factors so that the g.c.d. is 1.

If they are 'integer modulo 2 polynomials' however then their factorisations are...$\displaystyle 1 + x^{4} = (1 + x)\ (1 + x)\ (1 + x + x^{2})$$\displaystyle 1 + x + x^{2} = 1 + x + x^{2}$ ... so that the g.c.d. is $\displaystyle 1 + x + x^{2}$...

Kind regards $\chi$ $\sigma$
 
  • #5


Hello! It appears that you have correctly calculated the greatest common divisor using Euclidean division. However, it is possible that the textbook is referring to the greatest common divisor in the context of polynomials over a specific field or ring. In this case, the greatest common divisor would be the monic polynomial of highest degree that divides both $x^4+1$ and $x^2+x+1$. Since both polynomials have a degree of 4, the monic polynomial of highest degree would be 1, hence the result given in the textbook. Both results are correct, it just depends on the context in which you are considering the greatest common divisor. I hope this helps clarify any confusion!
 

FAQ: Greatest common divisor of polynomials

1. What is the greatest common divisor (GCD) of polynomials?

The GCD of polynomials is the highest degree polynomial that is a common factor of all the given polynomials.

2. How is the GCD of polynomials calculated?

The GCD of polynomials can be calculated by using the Euclidean algorithm, which involves repeated division and substitution to find the highest common factor.

3. Can the GCD of polynomials be negative?

No, the GCD of polynomials is always a positive polynomial. If necessary, it can be multiplied by -1 to make it negative.

4. What is the relationship between the GCD and the lowest common multiple (LCM) of polynomials?

The GCD and LCM of polynomials are related by the fact that their product is equal to the product of the given polynomials. In other words, GCD(a,b) * LCM(a,b) = a*b.

5. Can the GCD of polynomials be used to simplify fractions?

Yes, the GCD of the numerators and denominators of a fraction can be used to simplify the fraction by dividing both the numerator and denominator by the GCD.

Similar threads

Replies
1
Views
2K
Replies
8
Views
1K
Replies
2
Views
2K
Replies
2
Views
2K
Replies
8
Views
2K
Replies
2
Views
2K
Replies
4
Views
10K
Replies
10
Views
3K
Replies
4
Views
1K
Back
Top