Is this what you are looking for? sage: P.<x> = GF(2)[] sage: f = P.random_element(degree=31) sage: f.is_irreducible() False sage: while f.degree() != 31 or f.is_irreducible() is False: ....: f = P.random_element(degree=31) ....: sage: f.is_irreducible() True sage: f.degree() 31
On Wednesday 21 Mar 2012, clinton bowen wrote: > Hello, > > Is there a way to derive irreducible polynomials of degree n for the field > F 2? I am looking for the set of all irreducible polynomials of degree > n=31. If so, how is it done in sage? > > Thanks, > > clinton Cheers, Martin -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF _www: http://martinralbrecht.wordpress.com/ _jab: martinralbre...@jabber.ccc.de -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
