Sorry for not replying sooner. Some notes: For irreducibility, you don't need to worry about that. We already have full irreducibility algorithms implemented in the polys, so you can just use Poly(whatever).is_irreducible (you should be using entirely the polys, by the way). Feel free to implement further algorithms if you want (I don't know if we use that prime number one). I do know that we use a combination of rational root, Eisenstein, and as a final option, it passes the polynomial to the factorization algorithm, which is complete, so that if it returns the original polynomial as the complete factorization, we know that it must be irreducible.
What book specifically do you need? I have a copy of Dummit and Foote if that's the one you need. Aaron Meurer On Sat, Jan 26, 2013 at 9:18 PM, prasoon2211 <[email protected]> wrote: > Since I have not got any responses, I'll be trying to implement the special > case of solvable quintics: x^5 + ax +b =0 > If anyone has a problem/suggestion, now is the time to come forward. > Thanks > > -- > You received this message because you are subscribed to the Google Groups > "sympy" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > Visit this group at http://groups.google.com/group/sympy?hl=en. > For more options, visit https://groups.google.com/groups/opt_out. > > -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sympy?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
