Re: [sage-devel] Solving quintics

For reference, is there a Trac ticket for this? (But don't look now, wait until the current outage is resolved!) On Tuesday, August 30, 2022 at 6:01:35 AM UTC-4 achi...@gmail.com wrote: > Hello all, > > with the described class library, it is now possible to solve irreducible > solvable Bring-

Re: [sage-devel] Solving quintics

Hello all, with the described class library, it is now possible to solve irreducible solvable Bring-Jerrard quintics, i.e. f(x) = x^5 + ax + b. Coefficients are calculated up to a certain limit which is based on the Cantor counting scheme of rational numbers with default maxValue = 20. Higher n

Re: [sage-devel] Solving quintics

Thanks, David, that´s very helpful. I will look a bit deeper into these approaches. Kind regards Achim David Roe schrieb am Freitag, 5. August 2022 um 23:11:54 UTC+2: > Hi Achim, > Many of the polynomials you mention can be factored by Sage if you use > number fields for your coefficients rath

Re: [sage-devel] Solving quintics

Hi Achim, Many of the polynomials you mention can be factored by Sage if you use number fields for your coefficients rather than the symbolic ring. For example: sage: R. = ZZ[] sage: K. = NumberField(x^2 + x + 1) sage: f = x^5 + 9/2 * x^4 - 5/2 * x^3 - 2*w * x^2 - 9*w * x + 5*w sage: f.factor() (

[sage-devel] Solving quintics

Hello, I am new to this group and got the suggestion to post this here which I am happy to do. If you are interested in polynomials, esp. solving quintics, you may have a look at CoCalc -- Development I have spent some time studying q