This book aims to be an accessible introduction into the design and analysis of efficient algorithms. Throughout the book we will introduce only the most basic techniques and describe the rigorous mathematical methods needed to analyze them.

The topics covered include:

The divide and conquer technique.
The use of randomization in algorithms.
The general, but typically inefficient, backtracking technique.
Dynamic programming as an efficient optimization for some backtracking algorithms.
Greedy algorithms as an optimization of other kinds of backtracking algorithms.
Hill-climbing techniques, including network flow.

The goal of the book is to show you how you can methodically apply different techniques to your own algorithms to make them more efficient. While this book mostly highlights general techniques, some well-known algorithms are also looked at in depth. This book is written so it can be read from "cover to cover" in the length of a semester, where sections marked with a * may be skipped.

This textbook is an introductory coverage of algorithms and data structures with application to graphics and geometry.

Word Count: 15331

(Note: This resource's metadata has been created automatically by reformatting and/or combining the information that the author initially provided as part of a bulk import process.)

An openly licensed applied calculus textbook, covering derivatives, integrals, and an intro to multivariable calculus. This book is heavily remixed from Dale Hoffman's Contemporary Calculus textbook, and retains the same conceptual focus from that text.

Applied Calculus instructs students in the differential and integral calculus of elementary functions with an emphasis on applications to business, social and life science. Different from a traditional calculus course for engineering, science and math majors, this course does not use trigonometry, nor does it focus on mathematical proofs as an instructional method.

Applied Combinatorics is an open-source textbook for a course covering the fundamental enumeration techniques (permutations, combinations, subsets, pigeon hole principle), recursion and mathematical induction, more advanced enumeration techniques (inclusion-exclusion, generating functions, recurrence relations, Polyá theory), discrete structures (graphs, digraphs, posets, interval orders), and discrete optimization (minimum weight spanning trees, shortest paths, network flows). There are also chapters introducing discrete probability, Ramsey theory, combinatorial applications of network flows, and a few other nuggets of discrete mathematics.
Applied Combinatorics began its life as a set of course notes we developed when Mitch was a TA for a larger than usual section of Tom’s MATH 3012: Applied Combinatorics course at Georgia Tech in Spring Semester 2006. Since then, the material has been greatly expanded and exercises have been added. The text has been in use for most MATH 3012 sections at Georgia Tech for several years now. Since the text has been available online for free, it has also been adopted at a number of other institutions for a wide variety of courses. In August 2016, we made the first release of Applied Combinatorics in HTML format, thanks to a conversion of the book’s source from LaTeX to MathBook XML. An inexpensive print-on-demand version is also available for purchase. Find out all about ways to get the book.

Since Fall 2016, Applied Combinatorics has been on the list of approved open textbooks from the American Institute of Mathematics.

In writing this book, care was taken to use language and examples that gradually wean students from a simpleminded mechanical approach andmove them toward mathematical maturity. We also recognize that many students who hesitate to ask for help from an instructor need a readable text, and we have tried to anticipate the questions that go unasked.

The wide range of examples in the text are meant to augment the "favorite examples" that most instructors have for teaching the topcs in discrete mathematics.

To provide diagnostic help and encouragement, we have included solutions and/or hints to the odd-numbered exercises. These solutions include detailed answers whenever warranted and complete proofs, not just terse outlines of proofs.

Our use of standard terminology and notation makes Applied Discrete Structures a valuable reference book for future courses. Although many advanced books have a short review of elementary topics, they cannot be complete.

The text is divided into lecture-length sections, facilitating the organization of an instructor's presentation.Topics are presented in such a way that students' understanding can be monitored through thought-provoking exercises. The exercises require an understanding of the topics and how they are interrelated, not just a familiarity with the key words.

The wide range of examples in the text are meant to augment the "favorite examples" that most instructors have for teaching the topcs in discrete mathematics.

To provide diagnostic help and encouragement, we have included solutions and/or hints to the odd-numbered exercises. These solutions include detailed answers whenever warranted and complete proofs, not just terse outlines of proofs.

Our use of standard terminology and notation makes Applied Discrete Structures a valuable reference book for future courses. Although many advanced books have a short review of elementary topics, they cannot be complete.

The text is divided into lecture-length sections, facilitating the organization of an instructor's presentation.Topics are presented in such a way that students' understanding can be monitored through thought-provoking exercises. The exercises require an understanding of the topics and how they are interrelated, not just a familiarity with the key words.

An Instructor's Guide is available to any instructor who uses the text.

Best open source book in Discrete Math. Covers all the subjects in a standard Discrete Math class for mathematics or computer science students and contains sage cells for all subjects. Set Theory, Combinatorics, Logic, Relations, Recursion, Graph Theory, Trees, Algebraic Structures, Boolean Algebras, Automata, etc. Originally published commercially, its original text was peer-reviewed and was adopted for use at several universities throughout the country. Now in its open source version, has the same quality but it is free.

This applied mathematics textbook covers Matrices and Pathways, Statistics and Probability, Finance, Cyclic, Recursive and Fractal Patterns, Vectors, and Design. The approach used is primarily data driven, using numerical and geometrical problem-solving techniques.

Applied Mathematics, Third Edition. This textbook was written for the math component for Associate of Applied Science degrees at the College of Southern Nevada.

NSCC MATH 1020

Short Description:
Applied Math for Food Service is an adapted open textbook created by Amy Savoury. This new open textbook remixes content from two open textbooks published by BC Campus under CC BY licences: Basic Kitchen & Food Service Management by The BC Cook Articulation Committee, and Math for Trades by Chad Flinn and Mark Overgaard.

Word Count: 26676

ISBN: 978-1-990641-68-8

(Note: This resource's metadata has been created automatically by reformatting and/or combining the information that the author initially provided as part of a bulk import process.)

The primary learning objective of this textbook is to introduce the reader to the fundamental statistical methods and basic analytical procedures associated with processing data in regard to healthcare research. It is intended that by working through the applications and practice problems, readers should be able to understand and apply some of the methods for developing, implementing, and applying healthcare statistic principles in research.

Applied Technical Mathematics for Horticulture and Diesel Mechanics is intended for a one-semester class with students who enter the semester with a good working-level of math skills.  High school algebra and geometry are the only prerequisites,The technical math course at Kishwaukee College is unique in that the class combines students in horticulture with those from diesel mechanics.  The course materials apply to both areas, as much as possible.  The intent is to provide a solid foundation for solving job-related math problems for all students in the class.  For this reason, the focus is on "how to solve" more than "why does this work?"Feedback, comments, etc. would be greatly appreciated!Robert E. Brownrbrown3@kish.edu

Arithmetic | Algebra provides a customized open-source textbook for the math developmental students at New York City College of Technology. The book consists of short chapters, addressing essential concepts necessary to successfully proceed to credit-level math courses. Each chapter provides several solved examples and one unsolved “Exit Problem”. Each chapter is also supplemented by its own WeBWork online homework assignment. The book can be used in conjunction with WeBWork for homework (online) or with the Arithmetic | Algebra Homework handbook (traditional). The content in the book, WeBWork and the homework handbook are also aligned to prepare students for the CUNY Elementary Algebra Final Exam (CEAFE).

This course is an arithmetic course intended for college students, covering whole numbers, fractions, decimals, percents, ratios and proportions, geometry, measurement, statistics, and integers using an integrated geometry and statistics approach. The course uses the late integers model—integers are only introduced at the end of the course.

The text is mostly an adaptation of two other excellent open- source calculus textbooks: Active Calculus by Dr. Matt Boelkins of Grand Valley State University and Drs. Gregory Hartman, Brian Heinold, Troy Siemers, Dimplekumar Chalishajar, and Jennifer Bowen of the Virginia Military Institute and Mount Saint Mary's University. Both of these texts can be found at http://aimath.org/textbooks/approved-textbooks/.
The authors of this text have combined sections, examples, and exercises from the above two texts along with some of their own content to generate this text. The impetus for the creation of this text was to adopt an open-source textbook for Calculus while maintaining the typical schedule and content of the calculus sequence at our home institution.

Christopher Hammond, Professor of Mathematics at Connecticut College, published The Art of Analysis, an introductory textbook in real analysis. This resource is freely available for anyone to use, either individually or in a classroom setting.

The primary innovation of this text is a new perspective on teaching the theory of integration. Most introductory analysis courses focus initially on the Riemann integral, with other definitions discussed later (if at all). The paradigm being proposed is that the Riemann integral and the “generalized Riemann integral” should be considered simultaneously, not separately – in the same manner as uniform continuity and continuity. Riemann integrability is simply a special case of integrability, with particular properties that are worth noting. This point of view has implications for the treatment of other topics, particularly continuity and differentiability.

Word Count: 10612

(Note: This resource's metadata has been created automatically by reformatting and/or combining the information that the author initially provided as part of a bulk import process.)

On this webpage you will find several open Mathematics textbooks along with supplemental material and a few lecture videos.
The purpose of these discipline specific pages is to display content that might be of interest to faculty who are considering adopting open educational resources for use in their classes. This list of content is by no means exhaustive. The nature of open educational resources is very collaborative and it is in that spirit that we encourage any comments about the content featured on this page or recommendations of content that are not already listed here.