Differences between revisions 1 and 7 (spanning 6 versions)
Revision 1 as of 2008-11-30 21:12:00
Size: 27
Editor: Minh Nguyen
Comment:
Revision 7 as of 2008-12-02 03:09:47
Size: 1019
Editor: Minh Nguyen
Comment:
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
Describe sage-3.2.1 here. = Sage 3.2.1 Release Tour =

Sage 3.2.1 was released on December FIXME, 2008. For the official, comprehensive release notes, see [[http://www.sagemath.org/src/announce/sage-3.2.1.txt|sage-3.2.1.txt]].

== Algebra ==

Robert Bradshaw: a much simpler and faster algorithm for the divisors function over integers. The new optimized code is faster than a similar integer divisor function in the version of PARI/GP that's bundled with Sage 3.2.1, as well as outperforming a similar integer divisor function found in the version of Magma that Sage 3.2.1 interfaces with.

John Palmieri: a few methods for finite field elements including additive order, p-th power, and p-th root where p is the characteristic of the field.

== Basic arithmetic ==

Burcin Erocal: improving the user interface of polynomial classes.

John Palmieri, Carl Witty: a method to test whether a polynomial is square over the field it is defined. If the polynomial is square, then the method has the option of returning a square root.

Sage 3.2.1 Release Tour

Sage 3.2.1 was released on December FIXME, 2008. For the official, comprehensive release notes, see sage-3.2.1.txt.

Algebra

Robert Bradshaw: a much simpler and faster algorithm for the divisors function over integers. The new optimized code is faster than a similar integer divisor function in the version of PARI/GP that's bundled with Sage 3.2.1, as well as outperforming a similar integer divisor function found in the version of Magma that Sage 3.2.1 interfaces with.

John Palmieri: a few methods for finite field elements including additive order, p-th power, and p-th root where p is the characteristic of the field.

Basic arithmetic

Burcin Erocal: improving the user interface of polynomial classes.

John Palmieri, Carl Witty: a method to test whether a polynomial is square over the field it is defined. If the polynomial is square, then the method has the option of returning a square root.

ReleaseTours/sage-3.2.1 (last edited 2009-12-26 14:46:51 by Minh Nguyen)