On 14-Jan-10, at 1:36 PM, Georg S. Weber wrote:
+1
+1! Such factorizations also have applications to congruences
concerning Bell and Uppuluri-Carpenter combinatorial numbers.
Nick
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send
+1
Cheers,
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
Big speed improvements on calculations involving small finite fields,
like finding primitive elements? Possibility for automatic coercion
for finite fields? And the cost is just 0.5MB of harmless plain text
that doesn't even need to be compiled!?
Give it a +1!
Cheers
J
On Dec 18 2009, 11:16 pm,
