TEACHING ABSTRACT ALGEBRA THROUGH PROGRAMMING.

This note presents some examples of programming exercises usable in a first course on abstract algebra. The topics include detecting the properties of an algebraic operation on a finite set, implementing the Euclidean algorithm in different Euclidean rings, long division of polynomials over a finite field, finding all low-degree irreducible polynomials over a finite field. [ABSTRACT FROM AUTHOR]