1) Relations and Functions
Summary
2) Linear and Quadratic Functions
Summary
3) Polynomial Functions
Summary
4) Rational Functions
Summary
5) Further Topics in Functions
Summary
6) Exponential and Logarithmic Functions
Summary
7) Hooked on Conics
Summary
8) Systems of Equations and Matrices
Summary
9) Sequences and the Binomial Theorem
Summary
1.1) Sets of Real Numbers and the Cartesian Coordinate Plane
Summary
1.2) Relations
Summary
1.3) Introduction to Functions
Summary
1.4) Function Notation
Summary
1.5) Function Arithmetic
Summary
1.6) Graphs of Functions
Summary
1.7) Transformations
Summary
2.1) Linear Functions
Summary
2.2) Absolute Value Functions
Summary
2.3) Quadratic Functions
Summary
2.4) Inequalities with Absolute Value and Quadratic Functions
Summary
2.5) Regression
Summary
3.1) Graphs of Polynomials
Summary
3.2) The Factor Theorem and the Remainder Theorem
Summary
3.3) Real Zeros of Polynomials
Summary
3.4) Complex Zeros and the Fundamental Theorem of Algebra
Summary
4.1) Introduction to Rational Functions
Summary
4.2) Graphs of Rational Functions
Summary
4.3) Rational Inequalities and Applications
Summary
5.1) Function Composition
Summary
5.2) Inverse Functions
Summary
5.3) Other Algebraic Functions
Summary
6.1) Introduction to Exponential and Logarithmic Functions
Summary
6.2) Properties of Logarithms
Summary
6.3) Exponential Equations and Inequalities
Summary
6.4) Logarithmic Equations and Inequalities
Summary
6.5) Applications of Exponential and Logarithmic Functions
Summary
7.1) Introduction to Conics
Summary
7.2) Circles
Summary
7.3) Parabolas
Summary
7.4) Ellipses
Summary
7.5) Hyperbolas
Summary
8.1) Systems of Linear Equations: Gaussian Elimination
Summary
8.2) Systems of Linear Equations: Augmented Matrices
Summary
8.3) Matrix Arithmetic
Summary
8.4) Systems of Linear Equations: Matrix Inverses
Summary
8.5) Determinants and Cramer's Rule
Summary
8.6) Partial Fraction Decomposition
Summary
8.7) Systems of Non-Linear Equations and Inequalities
Summary
1.1.1) Sets of Numbers
Summary
1.1.2) The Cartesian Coordinate Plane
Summary
1.1.3) Introduction to Functions
Summary
1.1.4) Exercises
Summary
1.1.5) Answers
Summary
1.2.1) Graphs of Equations
Summary
1.2.2) Exercises
Summary
1.2.3) Answers
Summary
1.3.1) Exercises
Summary
1.3.2) Answers
Summary
1.4.1) Modeling with Functions
Summary
1.4.2) Exercises
Summary
1.4.3) Answers
Summary
1.5.1) Exercises
Summary
1.5.2) Answers
Summary
1.6.1) General Function Behavior
Summary
1.6.2) Exercises
Summary
1.6.3) Answers
Summary
1.7.1) Exercises
Summary
1.7.2) Answers
Summary
While the authors would like nothing more than to delve quickly and deeply into the sheer excitement that is Precalculus, experience has taught us that a brief refresher on some basic notions is welcome, if not completely necessary, at this stage. To that end, we present a brief summary of `set theory' and some of the associated vocabulary and notations we use in the text. Like all good Math books, we begin with a definition.
Definition 1.1. A set is a well-defined collection of objects which are called the `elements' of the set. Here, `well-defined' means that it is possible to determine if something belongs to the collection or not, without prejudice.
For example, the collection of letters that make up the word "smolko" is well-defined and is a set, but the collection of the worst math teachers in the world is not well-defined, and so is not a set. In general, there are three ways to describe sets. They are
Ways to Describe Sets
For example, let S be the set described verbally as the set of letters that make up the word "smolko". A roster description of S would be { s , m , o , l , k }. Note that we listed `o' only once, even though it appears twice in "smolko." Also, the order of the elements doesn't matter, so { k , l , o , m , s } is also a roster description of S. A set-builder description of S is:
{ x | x is a letter in the word "smolko".}
The way to read this is: 'The set of elements x such that x is a letter in the word "smolko".' In each of the above cases, we may use the familiar equals sign '=' and write S = { s , m , o , l , k } or S = { x | x is a letter in the word "smolko".}. Clearly m is in S and q is not in S. We express these sentiments mathematically by writing m ∈ S and q ∉ S. Throughout your mathematical upbringing, you have encountered several famous sets of numbers. They are listed below.
Sets of Numbers
It is important to note that every natural number is a whole number, which, in turn, is an integer. Each integer is a rational number (take b = 1 in the above definition for Q) and the rational numbers are all real numbers, since they possess decimal representations. If we take b = 0 in the above definition of C, we see that every real number is a complex number. In this sense, the sets N, W, Z, Q, R, and C are `nested' like Matryoshka dolls.
For the most part, this textbook focuses on sets whose elements come from the real numbers R. Recall that we may visualize R as a line. Segments of this line are called intervals of numbers. Below is a summary of the so-called interval notation associated with given sets of numbers. For intervals with nite endpoints, we list the left endpoint, then the right endpoint. We use square brackets, `[' or `]', if the endpoint is included in the interval and use a filled-in or `closed' dot to indicate membership in the interval. Otherwise, we use parentheses, `(' or `)' and an `open' circle to indicate that the endpoint is not part of the set. If the interval does not have nite endpoints, we use the symbols -∞ to indicate that the interval extends indefinitely to the left and ∞ to indicate that the interval extends indefinitely to the right. Since infinity is a concept, and not a number, we always use parentheses when using these symbols in interval notation, and use an appropriate arrow to indicate that the interval extends indefinitely in one (or both) directions.
Interval Notation
Let a and b be real numbers with a < b.
(chart)
For an example, consider the sets of real numbers described below.
(another chart)
We will often have occasion to combine sets. There are two basic ways to combine sets: intersection and union. We define both of these concepts below.
Definition 1.2. Suppose A and B are two sets.
Said differently, the intersection of two sets is the overlap of the two sets - the elements which the sets have in common. The union of two sets consists of the totality of the elements in each of the sets, collected together. For example, if A = { 1 , 2 , 3 } and B = { 2 , 4 , 6 }, then A ∩ B = { 2 } and A ∪ B = { 1 , 2, 3 , 4 , 6 }. If A = [-5,3) and B = (1,∞), then we can find A∩B and A∪B graphically. To find A∩B, we shade the overlap of the two and obtain A∩B = (1,3). To find A∪B, we shade each of A and B and describe the resulting shaded region to find A ∪ B = [-5,∞).
(images)
While both intersection and union are important, we have more occasion to use union in this text than intersection, simply because most of the sets of real numbers we will be working with are either intervals or are unions of intervals, as the following example illustrates.
Example 1.1.1. Express the following sets of numbers using interval notation.
Solution.
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
Content
9.1) Sequences
Summary
9.2) Summation Notation
Summary
9.3) Mathematical Induction
Summary
9.4) The Binomial Theorem
Summary
Content
Content
Content
Content