- Provides an introduction to number theory and algebra, with an emphasis on algorithms and applications.
- This text provides the students with simple cookbook recipes which covers the most significant issues of mathematical economics.
- This is a text for a problem-oriented course on mathematical logic and computability.
- Shows how several recently developed computer algorithms can simplify complex summations, presenting the underlying mathematical theory of these methods, the principle theorems and proofs, and the implementation using Maple packages.
This book divides roughly into a first half which develops the calculus (principally the differential calculus) in the setting of normed vector spaces, and a second half which deals with the calculus of differentiable manifolds.
Introduces the basic algorithms for computing and provides a constructive approach to abstract mathematics.
Describes in detail an algorithm based on modular symbols for computing modular elliptic curves. Also describes various algorithms for studying the arithmetic of elliptic curves.
An introduction to the elementary theory of numbers, in both technical (avoiding complex variable theory) and usual sense (that of being easy to understand).
Provides a unified treatment of analytic methods in combinatorics. Many examples are given that relate to words, integer compositions and partitions, paths and walks, graphs, mappings and allocations, lattice paths, permutations, trees, and planar maps.
Helps the student complete the transition from purely manipulative to rigorous mathematics.
Introduces differentiability as a local property without using limits. The course is designed for life science majors who have a precalculus background, and whose primary interest lies in the applications of calculus.
This book gives complete proofs of all theorems in one variable calculus and to at least give plausibility arguments for those in multiple dimensions. Serious students will find complete explanations in this book.
This is a freely available calculus book, covering a fairly standard course sequence: single variable calculus, infinite series, and multivariable calculus. There is no chapter on differential equations.
An easy-to-read introduction to Combinatorial Algorithms for any graduate student of mathematics or computer science. Provides a kit of building blocks with which the reader can construct more elaborate structures of his or her own.
A textbook for an introductory course in complex analysis. Topics from complex function theory, including contour integration and conformal mapping.
This is a student-oriented text covering the standard first year graduate course in complex variables. Solutions to all problems are included.
Focuses on four major directions in computational geometry: the construction of convex hulls, proximity problems, searching problems and intersection problems.
An applied exposition of proofs of numerous mathematical results useful in the modeling of physical systems. If you have seen a mathematical result, if you want to know why the result is so, you can look for the proof here.
Develops fundamental skills in algebra, trigonometry, indices and logarithms, equations and inequalities, as well as progressions. Includes differential and integral calculus in a reasonable level.
Provides training for a compulsory examination, designed to address the lack of fluency in elementary arithmetic and algebra.
This open source textbook contains material on calculus, functions of a complex variable, ordinary differential equations, partial differential equations and the calculus of variations. Includes exercises and solutions.
Introductory textbook for undergraduates, develops key ideas in probability and describes a variety of applications and of nonintuitive examples.
A suitable text for a first course on partial differential equations, Fourier series and special functions, and integral equations.
An introduction to mathematical logic, with an emphasis on proof theory and procedures for constructing formal proofs of formulae algorithmically.
Covers all of the basic material in the propositional and predicate calculus. Applications include non-standard models obtained by the means of compactness theorem and the generation of weak ultrawords and ultralogic operator.