# irreducibility using factor function()

Consider the polynomial p=x^3-3*x+4. Use the factor() function to determine if p is irreducible over:

irreducibility using factor function()

Consider the polynomial p=x^3-3*x+4. Use the factor() function to determine if p is irreducible over:

0

**
answered 2017-10-11 07:48:46 +0200 **

This post is a wiki. Anyone with karma >750 is welcome to improve it.

sage: R.<x> = IntegerModRing(5)[] sage: k = x^3 -3*x + 4 sage: K = k.factor(); K sage: k.is_irreducible()

sage: R.<x> = CC[] sage: p = x^3 -3*x + 4 sage: P = p.factor(); P sage: p.is_irreducible()

sage: R.<x> = CC[] sage: p = x^3 -3*x + 4 sage: P = p.factor(); P sage: p.is_irreducible()

Please start posting anonymously - your entry will be published after you log in or create a new account.

Asked: ** 2017-10-08 00:27:24 +0200 **

Seen: **131 times**

Last updated: **Oct 08 '17**

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.

This looks like homework. Please always mention the own effort to make sage compute something on the way. Here, a possibility to proceed - for each field - would be to construct the corresponding field, the ring of polynomials over it, then define $p$ over this field, finally ask for the factorization. For instance:

Which is the code for the other two fields? (Of course, we can already decide...)