Review for College Algebra Final Exam

Similar documents
Basic Elements of Arithmetic Sequences and Series

CS103X: Discrete Structures Homework 4 Solutions

Soving Recurrence Relations

5.3. Generalized Permutations and Combinations

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

Infinite Sequences and Series

NATIONAL SENIOR CERTIFICATE GRADE 12

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13

Trigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE The absolute value of the complex number z a bi is

.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth

FOUNDATIONS OF MATHEMATICS AND PRE-CALCULUS GRADE 10

1. MATHEMATICAL INDUCTION

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

2-3 The Remainder and Factor Theorems

Incremental calculation of weighted mean and variance

Your organization has a Class B IP address of Before you implement subnetting, the Network ID and Host ID are divided as follows:

Notes on exponential generating functions and structures.

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

Sequences and Series

THE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction

S. Tanny MAT 344 Spring be the minimum number of moves required.

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2

4.3. The Integral and Comparison Tests

How To Solve The Homewor Problem Beautifully

I. Chi-squared Distributions

Chapter 7 Methods of Finding Estimators

Department of Computer Science, University of Otago

SEQUENCES AND SERIES CHAPTER

CHAPTER 3 THE TIME VALUE OF MONEY

5 Boolean Decision Trees (February 11)

NATIONAL SENIOR CERTIFICATE GRADE 11

Lecture 5: Span, linear independence, bases, and dimension

Convexity, Inequalities, and Norms

Repeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.

Section 11.3: The Integral Test

BINOMIAL EXPANSIONS In this section. Some Examples. Obtaining the Coefficients

3. If x and y are real numbers, what is the simplified radical form

Properties of MLE: consistency, asymptotic normality. Fisher information.

Chapter 5: Inner Product Spaces

INFINITE SERIES KEITH CONRAD

Mathematical goals. Starting points. Materials required. Time needed

Solutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork

Asymptotic Growth of Functions

Now here is the important step

SEQUENCES AND SERIES

Theorems About Power Series

Permutations, the Parity Theorem, and Determinants

MATHEMATICS P1 COMMON TEST JUNE 2014 NATIONAL SENIOR CERTIFICATE GRADE 12

3. Greatest Common Divisor - Least Common Multiple

Lesson 15 ANOVA (analysis of variance)

Solutions to Exercises Chapter 4: Recurrence relations and generating functions

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix


5.4 Amortization. Question 1: How do you find the present value of an annuity? Question 2: How is a loan amortized?

PERMUTATIONS AND COMBINATIONS

Overview of some probability distributions.

Lecture 4: Cheeger s Inequality

1 Computing the Standard Deviation of Sample Means


I. Why is there a time value to money (TVM)?

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis

Listing terms of a finite sequence List all of the terms of each finite sequence. a) a n n 2 for 1 n 5 1 b) a n for 1 n 4 n 2

Lesson 17 Pearson s Correlation Coefficient

The following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles

hp calculators HP 12C Statistics - average and standard deviation Average and standard deviation concepts HP12C average and standard deviation

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return

Measures of Spread and Boxplots Discrete Math, Section 9.4

THE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n

Math 113 HW #11 Solutions

GCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.

Definition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

AP Calculus BC 2003 Scoring Guidelines Form B

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

A probabilistic proof of a binomial identity

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments

Descriptive Statistics

MARTINGALES AND A BASIC APPLICATION

Part - I. Mathematics

Solving Logarithms and Exponential Equations

BENEFIT-COST ANALYSIS Financial and Economic Appraisal using Spreadsheets

Time Value of Money. First some technical stuff. HP10B II users

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length

THE HEIGHT OF q-binary SEARCH TREES

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series

Sequences and Series Using the TI-89 Calculator

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006

1. C. The formula for the confidence interval for a population mean is: x t, which was

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

Institute of Actuaries of India Subject CT1 Financial Mathematics

Transcription:

Review for College Algebra Fial Exam (Please remember that half of the fial exam will cover chapters 1-4. This review sheet covers oly the ew material, from chapters 5 ad 7.) 5.1 Systems of equatios i two variables Vocabulary: system of (liear) equatios, solutio of a system of equatios, cosistet system, icosistet system, graphical method, substitutio method, elimiatio method, equivalet equatios A solutio (x, y) of a system of two equatios is a ordered pair which makes both equatios true. Graphical method: Each liear equatio defies a lie i the plae. Graph the lie for each equatio i the system ad fid the itersectio (overlap) of the lies. The itersectio could be lie (if the two lies are the same), a poit (most commo), or othig (if the lies are parallel but ot the same). If a system of equatios has at least oe solutio, it is cosistet. If ot, it is icosistet. Substitutio method: I oe of the equatios, solve for oe variable (say x) i terms of the other (say y) ad use the result to substitute for x i the other equatio. This other equatio will ow ivolve oly y s, ad you ca solve for y. Plug this y-value back ito the equatio you solved for x (this is called back-substitutio) i order to fid x. Of course, x ad y ca be switched i this whole process. Elimiatio method: Multiply oe or both equatios by a costat to get equivalet equatios for which either the x- or the y-coefficiets are egatives of each other. Add the equatios to elimiate oe variable. Solve for the other variable, ad the back-substitute ito oe of the origial equatios to fid the variable which was elimiated. 5.2 Systems of equatios i three variables To solve a system of three liear equatios i three variables, choose two pairs of equatios from the three equatios, ad elimiate the same variable from each pair usig the elimiatio method from 5.1. Now you have a system of two liear equatios i two variables. Use the elimiate method agai to elimiate aother variable ad solve for the value of the oe remaiig variable. Fially, back-substitute ito oe of the earlier two-variable equatios to fid the value of a secod variable, ad the back-substitute both values ito oe of the origial equatios to fid the value of the third variable. 5.7 Systems of iequalities ad liear programmig Vocabulary: liear iequality, half-plae, system of liear iequalities, objective fuctio, costraits, regio of feasible solutios

Graphig a liear iequality A liear iequality is a iequality that ca be writte i the form Ax + By < C, with A ad B ot both zero. The < sig may be replaced by >,, or. The iequality may also be give i slope-itercept form, such as y < mx + b. To graph the solutio set of a liear iequality: 1. Replace the iequality symbol with a equals sig ad draw the graph of the resultig liear equatio. Use a dotted lie if the symbol is < or > ad a solid lie if the symbol is or. The dotted lie meas that the poits o the lie are ot solutios, while the solid lie meas that the poits o the lie are solutios. 2. To determie which side (or half-plae) of the lie cotais solutios to the iequality, test whether a poit o oe side of the lie is a solutio. If it is, the shade that side of the lie. If it is ot, shade the other side of the lie. Graphig a system of liear iequalities A system of iequalities cosists of two or more iequalities cosidered simultaeously. For example: x y 5 2x + 3y > 0 The solutio set of a system is the set of poits which are solutios to every iequality i the system. To graph the solutio set of a system of liear iequalities: Graph the solutio set of each iequality o the same set of axes. The overlap of these solutios sets is the solutio set for the whole system. Istead of shadig the half-plae for each iequality, it is cleaer to draw small arrows idicatig which side would be shaded. The, usig this iformatio, you ca shade oly the solutio set for the etire system of equatios. A poit o more tha oe of the boudary lies is icluded i the fial solutio set if ad oly if all of the boudary lies cotaiig it are solid lies. Liear programmig To fid the maximum or miimum value of a liear objective fuctio subject to a set of liear costraits: 1. Graph the regio of feasible solutios (the solutio set for the system of costraits). 2. Fid the coordiates of the vertices of this regio of feasible solutios. 3. Evaluate the objective fuctio at each vertex ad fid the largest or smallest value.

7.1 Sequeces ad series Vocabulary: sequece, ifiite/fiite sequece, terms of a sequece, geeral term, alteratig sequece, series, ifiite/fiite series, partial sum, sigma/summatio otatio, idex of summatio, explicit defiitio, recursive defiitio Give a explicit or a recursive defiitio of a sequece, fid particular terms of the sequece directly from the defiitio. Give particular terms of a sequece, fid a explicit or a recursive defiitio of the sequece. Calculate partial sums by addig up the first few terms of a sequece. Evaluate expressios writte usig summatio otatio. Write expressios usig summatio otatio. 7.2 Arithmetic sequeces ad series Vocabulary: arithmetic sequece, commo differece, th term, arithmetic series Fid a recursive formula for a arithmetic sequece usig the first term a 1 ad the commo differece d: { a 1 = value of a 1 = a + d a +1 Fid a explicit formula for a arithmetic sequece usig the first term a 1 ad the commo differece d: a = a 1 + ( 1)d. Give ay two terms of a arithmetic sequece, fid the explicit formula for the sequece ad use it to determie ay other term of the sequece. Give the value of a term i a arithmetic sequece, determie which term it is. Fid the sum of a fiite arithmetic series usig the formula: ( ) a1 + a S = a k =. 2 Use arithmetic sequeces ad series to solve applied problems. 7.3 Geometric sequeces ad series Vocabulary: geometric sequece, commo ratio, geometric series, ifiite geometric series, limit Fid a recursive formula for a geometric sequece usig the first term a 1 ad the commo ratio r: { a 1 = value of a 1 = a r a +1

Fid a explicit formula for a geometric sequece usig the first term a 1 ad the commo ratio r: a = a 1 r 1. Give ay two terms of a geometric sequece, fid the explicit formula for the sequece ad use it to determie ay other term of the sequece. Give the value of a term i a geometric sequece, determie which term it is. Fid the sum of a fiite geometric series usig the formula: S = ( ) 1 r a k = a 1. 1 r Fid the sum of a ifiite geometric series usig the formula: S = a k = a 1 1 r. Write a ifiitely repeatig decimal as a fractio by expressig it as a ifiite geometric series ad the usig the sum formula above. Use geometric sequeces ad series to solve applied problems. 7.5 Combiatorics: permutatios Vocabulary: permutatio, the fudametal coutig priciple, combied actio, with/without repetitio, idetical/odistiguishable objects A permutatio is a ordered arragemet. Fid the umber of permutatios of objects usig the formula: P =! = ( 1)( 2) (3)(2)(1). Fid the umber of permutatios of objects take k at a time usig the formula: P k =! = ( 1)( 2) ( (k 1)). ( k)! If a combied actio ca be performed as a sequece of k steps, ad the ith step ca be performed i i ways, the the combied actio ca be performed i ways. 1 2 3 k Give differet letters, the umber of k-letter codes that ca be formed from the letters, with repetitio allowed, is k.

Suppose we have k differet types of objects, with i objects of type i, for each i. Suppose there are = 1 + 2 + + k total objects. The the umber of arragemets of all objects is:! 1! 2! k!. Apply these priciples to solve various coutig problems. The formulas will ot be give to you. It will be easier to remember them if you uderstad why they are true. 7.6 Combiatorics: combiatios Vocabulary: combiatio A combiatio is a uordered selectio or choice. Fid the umber of combiatios of objects take k at a time usig the formula: ( ) C k = = P k! = k kp k k!( k)!. Apply this formula, alog with the fudametal coutig priciple, to solve various coutig problems. The formula will ot be give to you. It will be easier to remember it if you uderstad why it is true. Choosig k people out of people to be o your committee is equivalet to choosig ( k) people out of people ot to be o your committee, hece: ( ) ( ) =. k k We ca cout the umber of committees of ay size which ca formed out of people i two differet ways, yieldig two expressios which must be equal: ( ) ( ) ( ) ( ) + + + + = 2. 0 1 2