Bookbot

Maurice Mignotte

    Mathematics for Computer Algebra
    Polynomials
    • 2011

      Mathematics for Computer Algebra

      • 364 stránok
      • 13 hodin čítania

      Focusing on advanced mathematical concepts, this textbook is designed for graduate students, building on foundational knowledge in set theory, algebra, and combinatorics. It emphasizes practical exercises that enhance understanding rather than direct application. The initial chapters cover essential Number Theory results like the Euclidean algorithm and Fermat's theorem, introducing abstract algebra concepts. Subsequent chapters explore polynomials over various rings, including in-depth analysis of polynomials with complex coefficients and their roots, providing valuable estimates for further study.

      Mathematics for Computer Algebra
    • 1999