0
votes
0answers
23 views

Proof for uniqueness for ideal multiplication

I am across the following question here: The uniqueness of a special maximal ideal factorization Let R be a domain, and let I be an ideal that is a product of distinct maximal ideals in two ways, ...
1
vote
0answers
30 views

Proof for maximal ideals in $\mathbb{Z}[x]$

I have been trying to prove the following theorem: Every maximal ideal in $\mathbb{Z}[x]$ has the form $(p, f(x))$ where p is prime integer and f is primitive integer polynomial that is irreducible ...
5
votes
3answers
90 views

Prove $x^3-3x+4$ is irreducible in $\mathbb{Q}[x]$

I want to prove $x^3-3x+4$ is irreducible in $\mathbb{Q}[x]$. Eisenstein's criterion doesn't apply here, so I think the simplest method would be to use the Rational Roots Test, right? If I can use ...
1
vote
2answers
65 views

Isomorphism between Rings $\mathbb{Z}[\frac{u}{v}]$ and $\mathbb{Z}[\frac{1}{v}]$, u,v relatively prime

Let $u$ and $v$ be relatively prime integers, and let $R'$ be the ring obtained from $\mathbb{Z}$ by adjoining an element $\alpha$ with the relation $v\alpha=u$. Prove that $R'$ is isomorphic to ...
1
vote
1answer
52 views

Artin 2nd Ed. Problem 12.5.3

The problem says "Find the generator for the ideal of $\mathbb{Z}[i]$ generated by $3 + 4i$ and $4 + 7i$." I don't understand the question. It asks us to find the generator of the ideal, but then it ...
1
vote
1answer
26 views

Proper factors and subsets of integral domains

We want to prove that if $R$ is an integral domain (with identity element $1_R$), then $a$ is a proper factor of $b$ (a proper factor meaning, there exists $c$ in $R$ such that $b = ac$, and $c$ is ...
1
vote
3answers
40 views

Factoring a polynomial in a field into irreducible

Factor $x^3 + 2x + 3$ into irreducible polynomials in $\mathbb{Z} _5 [x]$ This polynomial has 2 zeros mod 5: x = 2 and x = 4. But these only give me a 2 degree polynomial $x^2 - 4$ and I don't know ...
0
votes
1answer
60 views

$gcd(a,b)$ in a UFD subring is not a greatest common divisor in the ring

Give a counterexample that $R$ is a unique factorization domain but not a principal ideal domain, $S$ is a ring containing $R$, such that $a,b\in R$, $gcd(a,b)$ in $R$ is not a greatest common ...
0
votes
1answer
55 views

Let $R$ be an integral domain and $I$ be a prime ideal of $R$. If $R/I$ is a Euclidean domain, will $R$ be a unique factorization domain?

Let $R$ be an integral domain and $I$ be a prime ideal of $R$. If $R/I$ is a Euclidean domain, will $R$ be a unique factorization domain? I have no idea to prove or disprove this... should I prove ...
0
votes
0answers
58 views

The annihilator of finitely generated modules over PID

Let $R$ be a principal ideal domain. Let $M$ be a finitely generated $R$-module. Suppose there exists prime ideal $p$ and integer $i$ such that $p^i=\operatorname{Ann}(M)$. Then prove: (1) there ...
0
votes
1answer
26 views

If $a/s$ is irreducible in $R_{S}$, then $a$ is irreducible in $R$

Let $R$ be a UFD, and let $S$ be a multiplicative subset of $R$ containing the unity of $R$. Show that if $a/s$ is irreducible in $R_{S}$, then $a$ is irreducible in $R$. I showed that if $a$ is ...
0
votes
1answer
38 views

Inversion in factor rings

I have this polynomials: $f = x^{4} + 3x^{3} + x^2 + 3 \in \mathbb{Z}_{5}[x]$, $g = x + 2 \in \mathbb{Z}_{5}[x]$ Does g + (f) have inversion in ring $(\mathbb{Z}_{5}[x]/(f),+,.)$ ? I should found ...
2
votes
2answers
42 views

*Step* in proving that there are infinitely many primes that suffice…

Let $k,n\in \mathbb Z$ with $n=k^2+1$ and let $p$ be an odd prime with $p\mid n$. Prove that $p\equiv1\text{ mod }4$. I found out that $\bar{n}\in\left\{ \bar{1},\bar{2}\right\} $ (denoting ...
1
vote
1answer
48 views

Simple Calculation on Local Rings.

Let $p$ be prime and $\mathbb{Z}_{(p)}$ be the local ring. I already know, that \begin{align} \mathbb{Z}_{(p)}/p\mathbb{Z}_{(p)} \cong \mathbb{Z}/p\mathbb{Z}. \end{align} What ist the explicit map? ...
1
vote
1answer
95 views

Multivariate polynomial divisibility and Gauss's lemma

Let $\mathbb{F}$ be a field and $A(x,y)$ and $B(x,y)$ be polynomials in $\mathbb{F}[x,y]$. We would like to prove that $A(x,y)$ divides $B(x,y)$. Will the following approach work? We can interpret ...
5
votes
1answer
124 views

The uniqueness of a special maximal ideal factorization

The following problem is from Michael Artin's Algebra, chapter 12, M.6, unstarred: Let $R$ be a domain, and let $I$ be an ideal that is a product of distinct maximal ideals in two ways, say ...
2
votes
2answers
62 views

Nonunits in a Noetherian Domain have an Irreducible Factor

I think I've proven the following statement without using the fact that it is a domain: Prove every nonunit in a Noetherian domain has an irreducible factor. Proof: Suppose we have a ring which ...
1
vote
2answers
72 views

$\operatorname{\mathcal{Jac}}\left( \mathbb{Q}[x] / (x^8-1) \right)$

$\DeclareMathOperator{\Jac}{\mathcal{Jac}}$ Using the fact that $R := \mathbb{Q}[x]/(x^8-1)$ is a Jacobson ring and thus its Jacobson radical is equal to its Nilradical, I already computed that $\Jac ...
2
votes
0answers
44 views

Find the factorization of the polynomial as a product of irreducible [duplicate]

Find the factorization of the polynomial $x^5-x^4+8x^3-8x^2+16x-16$ as a product of irreducible on rings $R[x]$ and $C[x]$ Testing with the simplest possible root in this case, $P(1)=0$ Applying the ...
5
votes
2answers
240 views

Irreducibility of $x^n-x-1$ over $\mathbb Q$

I want to prove that $p(x):=x^n-x-1 \in \mathbb Q[x]$ for $n\ge 2$ is irreducible. My attempt. GCD of coefficients is $1$, $\mathbb Q$ is the field of fractions of $\mathbb Z$, and $\mathbb Z$ ...
2
votes
2answers
323 views

What is “prime factorisation” of polynomials?

I have the following question: Find the prime factorisation in $\mathbb{Z}[x]$ of $x^3 - 1, x^4 - 1, x^6 - 1$ and $x^{12} - 1$. You will need to check the irreduciblity in $\mathbb{Z}[x]$, of ...
2
votes
1answer
67 views

Can the Euclidean algorithm fail by not terminating in non Euclidean domains?

Is it possible for the Euclidean algorithm to fail by not terminating in finite time in non-Euclidean domains? In $\mathbb{Z}[X]$ it can fail by going out of the ring, ie one gets a non integer ...
3
votes
1answer
138 views

Classifying all ideals of a lattice $\mathbb{Z}[\sqrt{-d}]$

In Artin's Algebra he presents a method (that I am sure I am butchering) for classifying ideals of a given lattice $\mathbb{Z}[\sqrt{-d}]$ by taking any ideal $I$, choosing an element of minimum norm ...
1
vote
2answers
1k views

Factoring polynomials of degree 6 in 2 ways.

Let $P(x)$ be an integer polynomial of degree $6$ that is irreducible over the integers. $P(x) = x^6 + (A+a) x^5 + (B+ aA+ b) x^4 + (C+aB+bA +c) x^3 + (aC +bB +cA) x^2 + (bC+cB) x + cC = x^6 + ...
3
votes
2answers
345 views

Factoring in Z3[x]

I need to factor $x^6+x^4+x^2+1$ into irreducible parts in $Z_3[x]$. Obviously this polynomial reduces to $(x^4+1)(x^2+1)$ which is irreducible in $Z[x]$, but I'm not sure how to confirm that it's ...
0
votes
1answer
90 views

About Rings where the elements can be factored like $a^2 b$ … in multiple ways.

Im looking for non-UFD rings such that factoring of any element of that ring into irreducibles leads to either all factorizations squarefree or all factorizations squareful. Thus let $n$ be an ...
0
votes
0answers
146 views

Factoring polynomials $f(g(x))$ over extension fields.

This question is a variation on another one : related question Let $f(x)$ and $g(x)$ be polynomials with integer coefficients and discriminant of $f(x)$ > discriminant of $g(x)$ , which are ...
1
vote
1answer
118 views

Factoring polynomials of degree $a p^b$ over extension fields.

Let $f(x)$ be an irreducible polynomial with integer coefficients, which is irreducible over $\mathbb{Z}$ and has degree $a p^b > p$ with $p,a,b>0$ and $p$ a prime. It appears that $f(x)$ ...
0
votes
2answers
83 views

Find a prime number $p$ so that $f = \overline{3}x^3+ \overline{2}x^2 - \overline{5}x + \overline{1}$ is divided by $x-\overline{2}$ in $\mathbb Z_p$

Let $f = \overline{3}x^3+ \overline{2}x^2 - \overline{5}x + \overline{1}$ be defined in $\mathbb Z_p$. Find a prime number $p$ so that $f$ can be divided by $g = x-\overline{2}$, then factorize $f$ as ...
7
votes
3answers
110 views

How to see that the shift $x \mapsto (x-c)$ is an automorphism of $R[x]$?

In the process of studying irreducibility of polynomials, I encountered the criterion that $p(x)$ is irreducible if and only if $p(x-c)$ is irreducible. When trying to determine what properties of the ...
5
votes
1answer
194 views

Is $x^n+px+p^2$ irreducible in $\mathbb{Z}[x]$?

If $p\in\mathbb{N}$ is a prime, is $x^n+px+p^2$ irreducible in $\mathbb{Z}[x]$? I've proved that any non-unit factor in $\mathbb{Z}[x]$ must have degree at least 2. Eisenstein's criterion doesn't ...
5
votes
2answers
174 views

elegant way to show $P= t^{1024}+t+1$ is reducible in $\mathbf{F}_{2}[t]$

This is homework exercise: $$P=t^{1024} + t + 1 , R = \mathbf{F}_{2}[t] \Rightarrow P \ \text{reducible in R}$$ I wanted to show this analogous to how a book shows it (book shows it with other ...
25
votes
4answers
1k views

Fermat's Last Theorem and Kummer's Objection

In 1847 Lamé had announced that he had proven Fermat's Last Theorem. This "proof" was based on the unique factorization in $\mathbb{Z}[e^{2\pi i/p}]$. However, Kummer, proved that when $p=23$ we do ...