Hi, in order to get a root of the hilbert class polynomial mod p (p prime, D a fundamental discriminant), I am currently using the code lines
S = hilbert_class_polynomial(D); j = S.roots(GF(p))[0][0]; Is there a (fast) way to compute the hilbert class polynomial directly mod p in SAGE (thus avoiding the large coefficients computed by hilbert_class_polynomial(D); ) ? Thanks, Georg -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
