where Sage tried to find det(A) “modulo a few additional primes”. When a
prime p is large, Sage computes determinants (mod p) by lifting to Z. Sage
defines “large p” by reference to the size n of the matrix in question. A re-
cent tweak to another part of Sage’s matrix code had changed the definition
of “large p” to depend only on a constant for n ≤ 63.
Something does not "depend" on a constant, something "is" a constant.
And the "for n <= 63" can be removed, it is a constant not depending on n.
To clarify: the bound for "large p" *used* to depend on n but recent
changes before #14032 changed it to a constant bound not depending on n
at all.
The reason that determinant() only broke for n <= 63 is that the old
non-constant bound was larger than the new constant bound for n <= 63 only.
--
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.
