irreducibility using factor function()

homework

asked 2017-10-08 00:27:24 +0200

humfrey305
1

updated 2017-10-08 15:37:00 +0200

tmonteil
27333 ●31 ●203 ●514 http://wiki.sagemath.o...

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

a. finite field Z_5

b. the rationals

c. the complex numbers

edit retag flag offensive close merge delete

Comments

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:

sage: F = GF(5)
sage: F.<x> = PolynomialRing( F )    # or F[] for short, but criptic.
sage: factor( x^3 - 3*x + 4 )
x^3 + 2*x + 4

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

dan_fulea ( 2017-10-08 09:53:51 +0200 )edit

add a comment

Your Answer

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

irreducibility using factor function()

a. finite field Z_5

b. the rationals

c. the complex numbers

Comments

1 Answer

b. the rationals

c. the complex numbers

Your Answer

Question Tools

Stats

Related questions

irreducibility using factor function() edit

a. finite field Z_5

b. the rationals

c. the complex numbers

Comments

1 Answer

b. the rationals

c. the complex numbers