This book aims to promote constructive mathematics not by defining it or formalizing it but by practicing it. This means that its definitions and proofs use finite algorithms, not `algorithms' that require surveying an infinite number of possibilities to determine whether a given condition is met.The topics covered derive from classic works of nineteenth century mathematics - among them Galois' theory of algebraic equations, Gauss's theory of binary quadratic forms and Abel's theorem about integrals of rational differentials on algebraic curves. For Abel's theorem the main algorithm is Newton's polygon, which is given a full treatment. Other topics covered include the fundamental theorem of algebra, the factorization of polynomials over an algebraic number field, and the spectral theorem for symmetric matrices.

Rezensionen ( 0 )
Every Friday we give gifts for the best reviews.
The winner is announced on the pages of ReadRate in social networks.
Zitate (0)
Sie können als Erste ein Zitat veröffentlichen.