A Quintic and Higher Degree Polynomial Equations

Pikkugnome
Messages
23
Reaction score
6
TL;DR Summary
Formula for roots of higher degree polynomials.
What's the root formula for fifth and higher degree polynomial equations, which have roots in radicals?
 
Physics news on Phys.org
Pikkugnome said:
TL;DR Summary: Formula for roots of higher degree polynomials.

What's the root formula for fifth and higher degree polynomial equations, which have roots in radicals?
There are none for the general case, meaning, it has been proven that there cannot be such solutions.

I doubt that the class of polynomials of a certain degree higher than four that do have radical solutions can be described in a way that allows the listing of their roots. You can construct such polynomials by multiplying terms ##x-x_k ## but that won't exhaust these classes.
 
Only certain quintic polynomials are solvable. See this. It is related to Galois theory, which I know nothing about. I think that the higher degree polynomials are even more complicated. People usually resort to numeric algorithms for fourth degree and higher polynomials.
 
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...
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...
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...
Back
Top