Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2017-11-24 10:59:20 +0200 | received badge | ● Good Question (source) |
| 2016-10-06 14:16:51 +0200 | received badge | ● Nice Question (source) |
| 2016-06-23 12:01:29 +0200 | received badge | ● Student (source) |
| 2016-04-26 22:41:14 +0200 | received badge | ● Famous Question (source) |
| 2013-06-30 01:40:57 +0200 | received badge | ● Notable Question (source) |
| 2013-03-16 16:53:03 +0200 | received badge | ● Taxonomist |
| 2012-10-21 04:43:45 +0200 | received badge | ● Popular Question (source) |
| 2011-07-04 01:20:33 +0200 | commented answer | Factoring polynomials over IntegerModRings Maybe one of the reasons it is not implemented is because of non-unicity of factorizations. Polynomials over fields are UFDs, which make factorization implementable... I think I'll just compute an algorithm myself. Thanks for the comment. |
| 2011-07-04 00:30:00 +0200 | commented answer | Factoring polynomials over IntegerModRings I noticed we can use the factor command over fields, but not over rings... that is why I am asking the question here : is there any way I could use an already built-in command of Sage I don't know to do it, or should I find an algorithm myself and use it for my sole purposes? Note that the IntegerModRing(5) is actually a field, not a ring, so I am not suprised there is no problem. (Actually a little, but less surprised than if you had found a way to make it mod 25..) |
| 2011-07-03 23:17:48 +0200 | asked a question | Factoring polynomials over IntegerModRings I'd like to factor efficiently polynomials over rings (more particularly the rings of the form IntegerModRing(n), other rings don't interest me right now). I've noticed that you can factor a polynomial differently when considering FIELDS, so that something like factor(x^2-2, QQ[]) factor(x^2-2, RR[]) will output the different expected results. But what about x = var('x') factor(x^5-x, IntegerModRing(25)['x'])? What is actually outputted right now is (x-1)(x+1)(x^2+1)*x but the true factorization is x(x-1)(x+1)(x-7)(x+7) (I computed it by hand, Sage couldn't do it.) Going for small numbers like 25 is easy but when I go for large numbers I get nasty codes if I try to compute that myself. Isn't there anyway to make the factor command factor those polynomials or another way to do it? Any suggestion is welcome. I am new to Sage and I am beginning to love its features since I begin to study number theory and Sage has plenty of options for that purpose, but I must admit they are quite hard to understand since I am also new to Python, PARI, Magma... (not to programming though!) explanations in detail would be deeply appreciated. |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.