MHB Greatest common divisor of polynomials

evinda
Gold Member
MHB
Messages
3,741
Reaction score
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
You did not finish the Euclidean algorithm, which consists of several Euclidean divisions.
 
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! :)
 
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$
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...

Similar threads

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