This introduction to algebraic number theory via the famous problem of "Fermats Last Theorem" follows its historical development, beginning with the work of Fermat and ending with Kummers theory of "ideal" factorization.  Meer

This introduction to algebraic number theory via the famous problem of "Fermats Last Theorem" follows its historical development, beginning with the work of Fermat and ending with Kummers theory of "ideal" factorization.  Meer

This is an introduction to Galois Theory along the lines of Galois’s Memoir on the Conditions for Solvability of Equations by Radicals. It puts Galois’s ideas into historical perspective by tracing their antecedents in the works of Gauss, Lagrange, Newton, and even the ancient Babylonians.  Meer

Man sollte weniger danach streben, die Grenzen der mathe­ matischen Wissenschaften zu erweitern, als vielmehr danach, den bereits vorhandenen Stoff aus umfassenderen Gesichts­ punkten zu betrachten - E.  Meer

In a book written for mathematicians, teachers of mathematics, and highly motivated students, Harold Edwards has taken a bold and unusual approach to the presentation of advanced calculus.  Meer

In his new undergraduate textbook, Harold M. Edwards proposes a radically new and thoroughly algorithmic approach to linear algebra. Originally inspired by the constructive philosophy of mathematics championed in the 19th century by Leopold Kronecker, the approach is well suited to students in the computer-dominated late 20th century.  Meer

Contents and treatment are fresh and very different from the standard treatments Presents a fully constructive version of what it means to do...  Meer

This collection of essays aims to promote constructive mathematics, not by defining it or formalizing it, but by practicing it. All definitions and proofs are based on finite algorithms, which pave illuminating paths to nontrivial results, primarily in algebra, number theory, and the theory of algebraic curves.  Meer

This collection of essays aims to promote constructive mathematics, not by defining it or formalizing it, but by practicing it. All definitions and proofs are based on finite algorithms, which pave illuminating paths to nontrivial results, primarily in algebra, number theory, and the theory of algebraic curves.  Meer