This text was written as a prequel to the APEXCalculus series, a three–volume series on Calculus. This text is not intended to fully prepare students with all of the mathematical knowledge they need to tackle Calculus, rather it is designed to review mathematical concepts that are often stumbling blocks in the Calculus sequence. It starts basic and builds to more complex topics. This text is written so that each section and topic largely stands on its own, making it a good resource for students in Calculus who are struggling with the supporting mathemathics found in Calculus courses. The topics were chosen based on experience; several instructors in the Applied Mathemathics Department at the Virginia Military Institute (VMI) compiled a list of topics that Calculus students commonly struggle with, giving the focus of this text. This allows for a more focused approach; at first glance one of the obvious differences from a standard Pre-Calculus text is its size.

: Fundamental mathematics for adult learners. Book 1 includes a Table of Contents, Glossary, Grades Records, Self Tests, Practice Tests and Unit Tests. Ancillary Resources include the Instructor's Manual. This is 1 of a series of 6 books in the ABE Math collection.

: Fundamental mathematics for adult learners. Book 2 includes a Table of Contents, Glossary, Grades Records, Self Tests, Practice Tests and Unit Tests. Ancillary Resources include the Instructor's Manual. This is 1 of a series of 6 books in the ABE Math collection.

: Fundamental mathematics for adult learners. Book 3 includes a Table of Contents, Glossary, Grades Records, Self Tests, Practice Tests and Unit Tests. Ancillary Resources include the Instructor's Manual. This is 1 of a series of 6 books in the ABE Math collection.

: Fundamental mathematics for adult learners. Book 4 includes a Table of Contents, Glossary, Grades Records, Self Tests, Practice Tests and Unit Tests. Ancillary Resources include the Instructor's Manual. This is 1 of a series of 6 books in the ABE Math collection.

: Fundamental mathematics for adult learners. Book 5 includes a Table of Contents, Glossary, Grades Records, Self Tests, Practice Tests and Unit Tests. Ancillary Resources include the Instructor's Manual. This is 1 of a series of 6 books in the ABE Math collection.

: Fundamental mathematics for adult learners. Book 6 includes a Table of Contents, Glossary, Grades Records, Self Tests, Practice Tests and Unit Tests. Ancillary Resources include the Instructor's Manual. This is 1 of a series of 6 books in the ABE Math collection.

A comprehensive treatment of the advanced methods of applied mathematics. Designed to strengthen the mathematical abilities of graduate students and train them to think on their own. Review of elementary methods in complex analysis, ordinary differential equations, and partial differential equations. Expansions around regular and irregular singular points; asymptotic evaluation of integrals, regular perturbations; WKB method; multiple scale method; boundary-layer techniques.

This book is intended to help students prepare for entrance examinations in mathematics and scientific subjects, including STEP (Sixth Term Examination Papers). STEP examinations are used by Cambridge colleges as the basis for conditional offers in mathematics and sometimes in other mathematics-related subjects. They are also used by Warwick University, and many other mathematics departments recommend that their applicants practice on past papers to become accustomed to university-style mathematics.

Table of Contents
STEP
Worked Problems
Problems
Syllabus

Access also available here: https://www.openbookpublishers.com/product/342/advanced-problems-in-mathematics--preparing-for-university

Recent results in cryptography and interactive proofs. Lectures by instructor, invited speakers, and students. Alternate years. The topics covered in this course include interactive proofs, zero-knowledge proofs, zero-knowledge proofs of knowledge, non-interactive zero-knowledge proofs, secure protocols, two-party secure computation, multiparty secure computation, and chosen-ciphertext security.

Learning and Understanding Mathematical Concepts in the Areas of Water Distribution and Water Treatment

These courses, produced by the Massachusetts Institute of Technology, introduce the fundamental concepts and approaches of aerospace engineering, highlighted through lectures on aeronautics, astronautics, and design. MIT˘ď‹ď_s Aerospace and Aeronautics curriculum is divided into three parts: Aerospace information engineering, Aerospace systems engineering, and Aerospace vehicles engineering. Visitors to this site will find undergraduate and graduate courses to fit all three of these areas, from Exploring Sea, Space, & Earth: Fundamentals of Engineering Design to Bio-Inspired Structures

In this second term of Algebraic Topology, the topics covered include fibrations, homotopy groups, the Hurewicz theorem, vector bundles, characteristic classes, cobordism, and possible further topics at the discretion of the instructor.

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 course treats various methods to design and analyze datastructures and algorithms for a wide range of problems. The most important new datastructure treated is the graph, and the general methods introduced are: greedy algorithms, divide and conquer, dynamic programming and network flow algorithms. These general methods are explained by a number of concrete examples, such as simple scheduling algorithms, Dijkstra, Ford-Fulkerson, minimum spanning tree, closest-pair-of-points, knapsack, and Bellman-Ford. Throughout this course there is significant attention to proving the correctness of the discussed algorithms. All material for this course is in English. The recorded lectures, however, are in Dutch.

Continues 18.100, in the direction of manifolds and global analysis. Differentiable maps, inverse and implicit function theorems, n-dimensional Riemann integral, change of variables in multiple integrals, manifolds, differential forms, n-dimensional version of Stokes' theorem. 18.901 helpful but not required.

The text covered a comprehensive extent of topics; ranging from introductory topics of linear equations to more advanced topics such as Game Theory.

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 subject of enumerative combinatorics deals with counting the number of elements of a finite set. For instance, the number of ways to write a positive integer n as a sum of positive integers, taking order into account, is 2n-1. We will be concerned primarily with bijective proofs, i.e., showing that two sets have the same number of elements by exhibiting a bijection (one-to-one correspondence) between them. This is a subject which requires little mathematical background to reach the frontiers of current research. Students will therefore have the opportunity to do original research. It might be necessary to limit enrollment.