On 2014-12-30 11:12, Peter Bruin wrote:
GF(p, n) = GF(p^n) = GF(p).algebraic_closure().subfield(n)[0]
With this convention, an added benefit is that the distinguished
generator of GF(p, n) is called 'z' + str(n), which is less likely to be
confusing than just 'z'. For example:
sage: GF(3).algebraic_closure().subfield(5)[0]
Finite Field in z5 of size 3^5
Looks great!
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
