Providing basic material for a course in computer algebra, this book revises basic algebra concepts in a form suited for implementation on a computer using one of the available computer algebra systems. The book allows readers to test their own knowledge.

This book deals with several topics in algebra useful for computer science applications and the symbolic treatment of algebraic problems, pointing out and discussing their algorithmic nature. The topics covered range from classical results such as the Euclidean algorithm, the Chinese remainder theorem, and polynomial interpolation, to p-adic expansions of rational and algebraic numbers and rational functions, to reach the problem of the polynomial factorisation, especially via Berlekamp's method, and the discrete Fourier transform. Basic algebra concepts are revised in a form suited for implementation on a computer algebra system.

It provides a good way of revising abstract concepts learnt in algebra courses It shows the algorithmic nature of many concepts and theorems It allows the reader to test his/her knowledge of the computer algebra systems Includes supplementary material: sn.pub/extras

Inhalt
The Euclidean algorithm, the Chinese remainder theorem and interpolation.- p-adic series expansion.- The resultant.- Factorisation of polynomials.- The discrete Fourier transform.