irreducibility using factor function()
Consider the polynomial p=x^3-3*x+4. Use the factor() function to determine if p is irreducible over:
Consider the polynomial p=x^3-3*x+4. Use the factor() function to determine if p is irreducible over:
answered 2017-10-11 00:48:46 -0500
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()
Asked: 2017-10-07 17:27:24 -0500
Seen: 63 times
Last updated: Oct 07 '17
How can I find the sum of a series of integers with powers eg, n^(n 1)?
Can you please help me sove this? 2x-3y=1.3, y-x=0.5 [closed]
4x+6/y=15,6x-8/y=14 : y is not equal to zero Find p, if y=px-2 [closed]
How can I sketch the graph in sagemath like picture?
curves in a plane, find intersecting points?
Differentiation Worded Problem Involving Cos
how to generate elliptic curve over Extension field GF(2^m) where m=113 using sagemath
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...)