0% found this document useful (0 votes)
21 views8 pages

Review For Final Exam: December 28, 2017

The document provides a review of topics for a final exam, including finding maximum and minimum values, optimization word problems, graph sketching using derivatives, the Newton method for solving equations, L'Hospital's rule, Riemann sums, and the Fundamental Theorem of Calculus.

Uploaded by

Quoc Khanh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
21 views8 pages

Review For Final Exam: December 28, 2017

The document provides a review of topics for a final exam, including finding maximum and minimum values, optimization word problems, graph sketching using derivatives, the Newton method for solving equations, L'Hospital's rule, Riemann sums, and the Fundamental Theorem of Calculus.

Uploaded by

Quoc Khanh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Review for Final exam

December 28, 2017


Max-Min values
Concepts:
• Critical point
• Local max/min
• Absolute (global) max/min
Know how to find max/min on closed
interval
Optimization

• Word problem: READ CAREFULLY


• Ask for words that you don’t know
• Write down target function, variables,
condition
• Find max/min
Graph sketching
• First derivative: increasing/decreasing
intervals
• Second derivative: Concave up/down,
inflection point
• Vertical asymptotes: points where
lim = ∞
• Horizontal asymptotes: lim f (x)
x→∞
Newton method
• for solving f (x) = 0
• Start with x = x0
• Keep calculate
f (xn−1)
xn = xn−1 −
f 0(xn−1)

• Stop when |xn − xn−1| <the desired


error
L’Hospital rule
0 ∞
• Only apply for or
0 ∞
1
• 0.∞ use u =
1/u
• ∞ − ∞ find common denominator
• 1∞, 0∞, ∞0 use ln to convert to 0.∞
Riemann Sum
• Divide [a, b] into n parts
b−a
• Length ∆x =
n
• End points a = x0, x1, . . . , xn = b
• Choose xi∗ from [xi−1, xi]
n
X
• S = ∆x f (xi∗)
i=1
FTC
• Part 1:
Z x
d
f (t)dt = f (x)
dx a

• remember that x needs to be upper


limit
• Use with chain rule
d g(x)
Z
f (t)dt = f (g(x))g0(x)
dx a

You might also like