Math 115

Calculus, Part II with probability and matrices. (4h. 1 c.u.)

Functions of several variables, partial derivatives, multiple integrals, differential equations;
introduction to linear algebra and matrices with applications to linear programming and Markov
processes. Elements of probability and statistics. Applications to social and biological sciences.
Use of symbolic manipulation and graphics software in Calculus. Note: This course uses Maple.
Texts:
[C] Thomas/Finney, Calculus, 9th (or Alternate) Edition
[P]
Probability and Matrices, Custom Edition Containing Material Taken From:
Probability and Statistics, 3rd Edition, Morris H. DeGroot and Mark J. Schervish
and
[F]
Finite Mathematics, 7th Edition, Margaret Lial, Raymond N. Greenwell and
Nathan T. Ritchey
Maple/Calculus Lab Manual for Math 104/114/115
Syllabus:
Chapter Section & Topic
Core Problems
12. [C] Multivariable Functions and Partial Derivatives.
12.1 Functions of Several Variables.
5, 8, 13, 14, 15, 16, 17, 18, 19,
25, 45
12.2 Limits and Continuity.
11, 13, 16, 35
12.3 Partial Derivatives.
5, 19, 30, 47, 57, 63, 65
12.4 Differentiability, Linearization, and
5, 11, 20, 23, 24, 34a
Differentials
12.5 The Chain Rule.
3, 8, 17, 40, 41
12.7 Directional Derivatives, Gradient Vectors
2, 3, 17, 18, 27, 31, 43, 55
and Tangent Planes
12.8 Extreme Values and Saddle Points.
6, 11, 17, 29, 36, 39, 42, 53
12.9 Lagrange Multipliers.
5, 14, 21, 23, 32, 46
13 [C] Multiple Integrals
13.1 Double Integrals.

5, 8, 15, 21, 23, 26, 29, 33, 45,

53, 54, 68

1 [P] Introduction to Probability

1.5
The Definition of Probability
1.6
Finite Sample Spaces
1.7
Counting Methods
1.8
Combinatorial Methods
1.9
Multinomial Coefficients
1.10 The Probability of a Union of Events

7, 8
1-4
1, 3, 4, 5, 7, 8
2, 3, 4, 7, 17, 18
1, 3, 6, 8
1, 4, 5, 6, 9

Chapter Section & Topic

2 [P] Conditional Probability
2.1
The Definition of Conditional Probability
2.2
Independent Events
2.3
Bayes' Theorem

Core Problems
6, 9, 10
7, 8, 9, 10, 12, 16, 19
1, 2, 10, 11, 12

3 [P] Random Variables

3.1
Random Variables and Discrete Distribution
3.2
Continuous Distribution
3.3
The Distribution Function
3.4
Bivariate Distribution

2, 3, 4, 8
2-8
3-8
see below

4 [P] Expectation
4.1
The Expectation of a Random Variable
4.2
Properties of Expectations
4.3
Variance

1, 2, 4, 5, 9
6, 7, 8, 10
1, 2, 3, 6, 7, 9

5 [P] Special Distributions

5.2
The Bernoulli and Binomial Distribution
5.4
The Poisson Distribution
5.6
The Normal Distribution
5.9
The Gamma Distribution

3-7, 10
2, 3, 6
3, 7, 9, 10
8, 9, 13, 14

1 [F] Least Squares Fit

1.3
The Least Squares Line

8, 10, 11, 17

2 [F] Linear Equations and Matrices

2.1
Solution of Linear Systems by the
Echelon Method
2.2
Solution of Linear Systems by the
Gauss-Jordan Method
2.3
Addition and Subtraction of Matrices
2.4
Multiplication of Matrices
2.5
Matrix Inverses
2.6
Input-Output Models
2 [P] Markov Chains
2.4
Markov Chains
3 [F] Linear Programming I
3.1
Graphing Linear Inequalities
3.2
Solving Linear Programming
Problems Graphically
3.3
Applications of Linear Programming
2

23, 25, 29
17, 24, 27, 28, 33, 39, 40
27, 29
15, 24, 30, 31
11, 13, 15, 17, 19, 22, 23
1, 5, 17
2, 3, 11, 12,
Also find limiting distributions
21, 23, 25, 29
7, 9, 13
17, 21

Chapter
Section & Topic
4 [F] Linear Programming II
4.1
Slack Variables and the Pivot
4.2
Maximization Problems
4.3
Minimization Problems; Duality

Core Problems
5, 7, 21
7, 9
5, 7, 13

SAMPLE EXAM QUESTIONS also form a part of the core.

The core problems indicate the kind of basic problems you will need to be able to solve by hand.
They also provide a guide to the basic level of difficulty to be expected on the final exam.
Note: All sections of Math 115 have a COMMON FINAL EXAM
Problems for section 3!.!4!: !B!i!v!a!r!i!a!t!e! !D!i!s!t!r!i!b!u!t!i!o!n!s! !
1!.! !S!u!p!p!o!s!e! !t!h!e! !j!o!i!n!t! !p!.!d!.!f!.! !o!f! !a! !p!a!i!r! !o!f! !r!a!n!d!o!m! !v!a!r!i!a!b!l!e!s! !o!n! !t!h!e! !r!e!c!t!a!n!g!l!e! !g!i!v!e!n! !b!y! !0! !<! !x! !<! !2!,! !0! !<! !y!
!<! !1! !i!s! !g!i!v!e!n! !b!y! !f!(!x!,! !y!)! !=! !1!/!2!.! !C!o!m!p!u!t!e! !P!r!o!b!(!X! !>! !Y! !)! !
2!.! !S!u!p!p!o!s!e! !t!h!e! !j!o!i!n!t! !p!.!d!.!f!.! !o!f! !a! !p!a!i!r! !o!f! !r!a!n!d!o!m! !v!a!r!i!a!b!l!e!s! !o!n! !t!h!e! !r!e!c!t!a!n!g!l!e! !g!i!v!e!n! !b!y! !0! !<! !x! !<! !2!,! !0! !<! !y!
!<! !1! !i!s! !g!i!v!e!n! !b!y! !f!(!x!,! !y!)! !=! !x!y!.! !C!o!m!p!u!t!e! !P!r!o!b!(!X! !>! !Y! !)! !
3!.! !S!u!p!p!o!s!e! !t!h!e! !j!o!i!n!t! !p!.!d!.!f!.! !o!f! !a! !p!a!i!r! !o!f! !r!a!n!d!o!m! !v!a!r!i!a!b!l!e!s! !o!n! !t!h!e! !f!i!r!s!t! !q!u!a!d!r!a!n!t! !0! !<! !x!,! !0! !<! !y! !i!s! !g!i!v!e!n!
!b!y! !f!(!x!,! !y!)! !=! !6!e! !(!2!x!+!3!y!)! !A!s!s!u!m!e! ! a! !>! !0!.! !C!o!m!p!u!t!e! !P!r!o!b!(!X! !>! !a!)!,! !P!r!o!b!(!Y! !>! !a!)!,! !P!r!o!b!(!m!i!n!(!X!,! !Y! !)! !>! !a!)!
!a!n!d! !P!r!o!b!(!X! !>! !Y! !)! !
4!.! !S!u!p!p!o!s!e! !t!h!e! !j!o!i!n!t! !p!.!d!.!f! !o!f! !n!-!r!a!n!d!o!m! !v!a!r!i!a!b!l!e!s! !x!(!k!)!,! !k! !=! !1!,! !.! !.! !.! !,! !n! !o!n! !t!h!e! !r!e!g!i!o!n! !0! !<! !x!k! !<! !2! !f!o!r! !k!
!=! !1!,! !.! !.! !.! !,! !n! !i!s! !f!(!x!)! !=! !2!! n!.! !L!e!t! !Y! !=! !x1! ! !+! !x!2! !+! !.! !.! !.! !+! !x!n! !C!o!m!p!u!t!e! !E!(!Y! !)! !a!n!d! !E!(!Y!2! !)!.! !H!i!n!t!.! !F!o!r!
!i!n!d!e!p!e!n!d!e!n!t! !r!a!n!d!o!m! !v!a!r!i!a!b!l!e!s! !w!e! !h!a!v!e! !t!h!e! !m!e!a!n!s! !a!n!d! !v!a!r!i!a!n!c!e!s! !a!d!d!.! !