Mathematics for computer algebra
- Exclusive ContentScan the cover in the app
- CommunityDiscuss & Share
About this book
Originating from a graduate-level course taught at the University Louis Pasteur in Strasbourg during the 1986-87 academic year, this volume is aimed chiefly at advanced students. Readers should already know basic set theory, the integers, a little combinatorics such as Newton's binomial expansion, high-school analysis, and the fundamentals of groups, rings, fields and linear algebra.
The opening two chapters cover elementary number theory, including the Euclidean algorithm, the Chinese remainder theorem and Fermat's little theorem. Beyond their own value, these topics serve as a concrete route into abstract algebra, illustrating ideas such as Euclidean and principal rings. Algorithms for arithmetic on long integers are also presented.
Chapters three through seven turn to polynomials, first over arbitrary rings and then, in chapter four, over the complex numbers, where many estimates on the location of complex roots are developed. Those estimates are used repeatedly in later chapters. The exercises form a substantial part of the book; they usually extend the text rather than apply it directly, and hints or references are provided to guide the reader toward solutions.
Reader reviews
No reviews yet. Share your thoughts on this book in the Appilog app.
Book Details
- ISBN
- 9780387976754
- Author
- Maurice Mignotte
- Publisher
- Unknown Publisher
- Genres
- Science & MathematicsTextbooks & Exam Prep
Media & Extras
This book has 0 videos that play on its cover. Scan the cover with the Appilog app to watch.
Get the app
