Prove Polynomials of Degree 1, 2 & 4 Have Roots in Z_2[x]/(x^4+x+1)

  • Thread starter Thread starter whodoo
  • Start date Start date
  • Tags Tags
    Polynomial Roots
whodoo
Messages
4
Reaction score
0
I want to show that every polynomial of degree 1, 2 and 4 in Z_2[x] has a root in Z_2[x]/(x^4+x+1). Any ideas?

Ps. How can I use latex commands in my posts?
 
Physics news on Phys.org
You can just do it by exhaustion. There are very few cases to think about (and if you have to start thinking about the case deg=1 then you're missing something).

LaTeX is explained in the introduction to LaTeX thread (probably in physics): just look around.
 
Okey, something like this?
The case deg 1 is obvious. The case 2 is obvious except for the irreducible x^2+x+1, where I can find a solution. Degree 4 is obvious except for the irreducible cases which I can try?

Im not really satsified with this solution.
 
Why not? Have you actually tried to look at the irreducible casees? If you do you might figure out what a general condition would be, and why the degs 1,2,4 polys all satisfyit (and presumably why there is a deg 3 poly that doesn't). You won't figure out a general criterion just by pulling it out of thin air. You look at cases where it is true, where it isn't and figure out what quantifies the difference. That's how you do maths.
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\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...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

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...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

I Quintic Polynomial Tschirnhaus Transform: Possible complex Bring Radicals
Replies
0
Views
2K
I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?
Replies
48
Views
3K
I Finding a polynomial that has solution (root) as the sum of roots
Replies
13
Views
2K
I Looking for a creative or quick method for finding roots in GF(p^n)
Replies
3
Views
1K
I I think I've hit upon a very easy proof of impossibility of quintic
Replies
2
Views
2K
I Proving properties of polynomial in K[x]
Replies
8
Views
2K
I Proving the Existence of Roots in Complex Polynomials
Replies
43
Views
6K
I Matrix rank in terms of determinant polynomial
Replies
14
Views
3K
Constructing a field of 4 elements
Replies
4
Views
5K
MHB The polynomial is irreducible over Q(i)
Replies
16
Views
3K

Hot Threads

Recent Insights

Back
Top