Abstract This note presents some programming exercise examples usable in a first course of abstract algebra.
The topics include detecting properties of an algebraic operation in 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. ![Creative Commons License](https://i.creativecommons.org/l/by/4.0/80x15.png)
|