irreducibility of a polynomial

Loading [MathJax]/jax/output/HTML-CSS/jax.js

nebuckandazzer
177 ●11 ●12 ●19

If f $f(x)$ is a polynomial, i know that the command $f.factor()$ gives the factorization of f. But I am interested in knowing whether the polynomial is irreducible or not, not its factors. Is there any command for that ?

Comments

To display inline code, surround it within backticks .... This way you could get f.factor() instead of $f.factor()$ .

slelievre ( 8 years ago )

thanks @slelievre

nebuckandazzer ( 8 years ago )

add a comment

1 Answer

Sort by » oldest newest most voted

answered 8 years ago

vdelecroix
7640 ●20 ●85 ●168 http://www.labri.fr/pe...

There is

sage: R = ZZ['x']
sage: x = R.gen()
sage: (x^2 + 2*x + 1).is_irreducible()
False
sage: (x^2 - x + 1).is_irreducible()
True

Note that the irreducibility depends on the base ring (the integers in the example above).

sage: xZZ = polygen(ZZ)
sage: xQQ = polygen(QQ)
sage: (2*xZZ).is_irreducible()
False
sage: (2*xQQ).is_irreducible()
True

link

add a comment

Your Answer

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

Add Answer

Question Tools

1 follower

Stats

Asked: 8 years ago

Seen: 6,973 times

Last updated: Jul 26 '16

irreducibility of a polynomial savecancel

Comments

1 Answer

Your Answer

Question Tools

Stats

Related questions