This free online textbook is a one semester course in basic analysis. These were my lecture notes for teaching Math 444 at the University of Illinois at Urbana-Champaign (UIUC) in fall 2009. The course is a first course in mathematical analysis aimed at students who do not necessarily wish to continue a graduate study in mathematics. A Sample Darboux sums prerequisite for the course is a basic proof course. The course does not cover topics such as metric spaces, which a more advanced course would. It should be possible to use these notes for a beginning of a more advanced course, but further material should be added.

This course is a brief introduction to sequences and infinite series. We begin with a discussion of power series and develop tests for convergence and non-convergence. Taylor series are introduced and lead to an analysis of power series in general. This is a 1-credit course that can be taken any time after the student has completed Calculus I. All course content created by Javad Moulai. Content added to OER Commons by Julia Greider.

This course is a brief introduction to sequences and infinite series. We begin with a discussion of power series and develop tests for convergence and non-convergence. Taylor series are introduced and lead to an analysis of power series in general. This is a 1-credit course that can be taken any time after the student has completed Calculus I.

CK-12 Calculus Teacher's Edition covers tips, common errors, enrichment, differentiated instruction and problem solving for teaching CK-12 Calculus Student Edition. The solution guide is available upon request.

Calculus is designed for the typical two- or three-semester general calculus course, incorporating innovative features to enhance student learning. The book guides students through the core concepts of calculus and helps them understand how those concepts apply to their lives and the world around them. Due to the comprehensive nature of the material, we are offering the book in three volumes for flexibility and efficiency. Volume 2 covers integration, differential equations, sequences and series, and parametric equations and polar coordinates.

Discrete Mathematics: An Open Introduction is a free, open source textbook appropriate for a first or second year undergraduate course for math majors, especially those who will go on to teach. The textbook has been developed while teaching the Discrete Mathematics course at the University of Northern Colorado. Primitive versions were used as the primary textbook for that course since Spring 2013, and have been used by other instructors as a free additional resource. Since then it has been used as the primary text for this course at UNC, as well as at other institutions.

This course describes discrete mathematics, which involves processes that consist of sequences of individual steps (as compared to calculus, which describes processes that change in a continuous manner). The principal topics presented in this course are logic and proof, induction and recursion, discrete probability, and finite state machines. Upon successful completion of this course, the student will be able to: Create compound statements, expressed in mathematical symbols or in English, to determine the truth or falseness of compound statements and to use the rules of inference to prove a conclusion statement from hypothesis statements by applying the rules of propositional and predicate calculus logic; Prove mathematical statements involving numbers by applying various proof methods, which are based on the rules of inference from logic; Prove the validity of sequences and series and the correctness or repeated processes by applying mathematical induction; Define and identify the terms, rules, and properties of set theory and use these as tools to support problem solving and reasoning in applications of logic, functions, number theory, sequences, counting, probability, trees and graphs, and automata; Calculate probabilities and apply counting rules; Solve recursive problems by applying knowledge of recursive sequences; Create graphs and trees to represent and help prove or disprove statements, make decisions or select from alternative choices to calculate probabilities, to document derivation steps, or to solve problems; Construct and analyze finite state automata, formal languages, and regular expressions. (Computer Science 202)

Students continue exploring coding sequences, using the programming game Lightbot.
As students work through tricky puzzles and make use of the Lightbot interface’s ability to restart execution from the beginning, they experience the value of iterative development.
If they are ready, students advance from Lightbot’s introductory levels to levels that require them to create and use procedures (functions).
Iterative development, and the shift from long, repetitive code to shorter, clearer code, are both concepts that will be relevant to students’ final coding project at the end of the unit.

This is a great textbook for Intermediate Algebra or College Algebra course. This textbook includes covers standard topics such as linear functions/equation, graphs and functions, systems of linear equations, polynomials, rational functions, roots and radicals, quadratic functions/equations, exponential and logarithmic functions, conics, and sequences and series. All of topics are self-contained and instructors do not have to provide supplements. However, instructors, who plan to cover trigonometric functions, may need to provide extra materials.

In this lesson, through various examples and activities, exponential growth and polynomial growth are compared to develop an insight about how quickly the number can grow or decay in exponentials. A basic knowledge of scientific notation, plotting graphs and finding intersection of two functions is assumed.

Students use the board game Robot Turtles to write code by creating sequences of steps for a character to follow.
They encounter bugs and learn why bugs are important learning opportunities, not mistakes to avoid.
They see and discuss examples of bugs in robots and computers.