Index cards characteristics and theoremstschmucker
油
The document defines and explains concepts related to concavity, points of inflection, absolute extrema, increasing and decreasing intervals, local extrema, and theorems such as the Mean Value Theorem, Rolle's Theorem, the Second Derivative Test, the Extreme Value Theorem, the Intermediate Value Theorem, and Fermat's Theorem. It provides definitions, steps to find or determine each concept, and how the theorems relate to finding critical points and values of functions.
This document discusses key concepts related to finding extrema of functions:
- Absolute and relative extrema refer to the maximum and minimum values of a function over its entire domain or on a sub-interval, respectively. Critical points where the derivative is zero or undefined must be checked.
- The Extreme Value Theorem states that if a function is continuous on a closed interval, it will have both a maximum and minimum value on that interval.
- To find extrema, one finds all critical points, checks the endpoints, and compares the function values to determine the maximum and minimum. The derivative indicates whether a function is increasing or decreasing and points where it is zero or undefined.
Extreme values of a function & applications of derivativeNofal Umair
油
This document discusses key concepts related to finding extrema of functions, including:
- Absolute and relative extrema refer to the maximum and minimum values of a function over its entire domain or on a subinterval, respectively.
- Critical points, where the derivative is zero or undefined, and endpoints must be checked to find extrema.
- The Extreme Value Theorem states that continuous functions on closed intervals have both a maximum and minimum value.
- The first derivative determines whether a function is increasing or decreasing, and where it is zero may indicate relative extrema. The second derivative indicates concavity and points of inflection.
The document discusses recursion and provides examples of recursive algorithms and code implementations. It defines recursion as a function calling itself directly or indirectly. Examples given include computing factorials recursively and calculating the sum of digits of a number recursively. Algorithms are presented for checking if a number is prime recursively and calculating the sum of the first N natural numbers recursively. Code snippets are included to demonstrate recursive implementations in C.
This document discusses concepts related to using the first and second derivatives to analyze functions and graph their behavior, including:
- Concave up and down shapes defined by increasing/decreasing rate of change
- Inflection points occurring where concavity changes
- The second derivative indicating the rate of change of the rate of change (concavity) of the original function
- Using the second derivative test to determine if critical points are relative maxima or minima based on the concavity.
It provides examples of applying these concepts to specific functions through determining critical points, inflection points, intervals of increasing/decreasing behavior, and concavity. It also demonstrates graphing functions based on this analysis
This document discusses various methods for estimating and calculating square roots. It begins by defining irrational numbers as non-repeating decimals that can result from taking the square root of a non-perfect square. It then discusses estimating square roots by knowing perfect square numbers and using guess and check methods. Later sections cover using calculators, applying square roots in formulas, exponent rules including multiplication, division, powers, and scientific notation for writing extremely large numbers.
The document explains the steps of the Simplex method for solving linear programs: 1) Transform the problem into standard form; 2) Introduce slack variables; 3) Create a Simplex tableau; 4) Use pivot variables and row operations to optimize variables until the optimal solution is found where all objective values are positive. The method involves iteratively creating new tableaus until the optimal values are identified.
The document explains the steps of the Simplex method for solving linear programs: 1) Transform the problem into standard form, 2) Introduce slack variables, 3) Create a Simplex tableau, 4) Check for optimality and identify a pivot variable if not optimal, 5) Create a new tableau to optimize the pivot variable, 6) Repeat until an optimal solution is found, then 7) Identify the optimal values. The Simplex method uses tableaus and pivot variables to iteratively find an optimal solution satisfying all constraints.
This document provides a review of concepts covered in Module 4 including:
1) Direct and inverse variation relationships and examples of each. Direct variation passes through the origin on a graph while inverse variation relates two variables according to a constant product.
2) Converting between radical expressions and rational exponents by applying exponent rules such as exponent is applied to each factor in parentheses or adding exponents of common bases.
3) Explaining the difference between rational and irrational numbers where rational numbers can be expressed as fractions and irrational numbers cannot.
4) Graphing a radical equation, finding the vertex, domain, range, intercepts, and rate of change.
5) Defining extraneous solutions as solutions to
Homework on identifying key properties of functions such as the domain, intercepts, asymptotes, derivative, critical numbers, intervals of increasing/decreasing behavior, extrema, second derivative, points of inflection, and sketching the graph is due the first meeting next week. Instructions provide guidance on analyzing functions to find these properties.
This document discusses functions in C/C++. It covers advantages of functions like modularity and reusability. It explains how to write functions, including return types, passing arguments by value or reference, and function prototypes. Examples demonstrate writing functions to find the maximum of two numbers, square a number, and convert characters to uppercase. The differences between call by value and call by reference are explained using examples. The document also discusses passing structures to functions and returning multiple values or values of different types from functions.
This document provides information about teaching place value to students. It defines key terms like zero, place value, number, and number line. It explains the importance of understanding place value and how it relates to counting and representing numbers on a number line. Activities are suggested, like having students roll dice and write numbers in place value form to understand the meaning of different digit positions. Questions are provided to check understanding, and visual examples like rods divided into pieces are described to illustrate place value concepts. Finally, resources for teachers and additional activities are listed.
The document discusses different types of operators in programming languages like C and C++. It explains that operators take operands as inputs and produce outputs. Common operators covered include arithmetic operators (+, -, *, /, %), unary operators (+, -), increment/decrement operators (++, --), relational operators (<, >, <=, >=, ==, !=), logical operators (&&, ||, !), and others. Examples are provided to demonstrate the usage of each operator. The key purpose of operators is to perform computations on operands through expressions.
The document covers three topics:
1) Composite functions and finding f[g(0)] for a given function.
2) The derivative and its applications, including proving the derivative of a function and finding the equation of a tangent line.
3) Polynomial functions, including finding the y-intercept, x-intercepts, critical points and intervals of increase/decrease to sketch the graph of a polynomial function.
The document discusses dynamic programming and provides examples of problems that can be solved using dynamic programming techniques. It describes characteristics of dynamic programming problems such as overlapping subproblems and optimal substructure properties. It also describes two common approaches to dynamic programming - top-down with memorization and bottom-up with tabulation. Finally, it lists 12 practice problems related to topics like staircase problem, tiling problem, friends pairing problem, house thief problem, minimum jumps problem, Catalan numbers, binomial coefficients, permutation coefficients, subset sum problem, 0/1 knapsack problem, longest common subsequence and edit distance that can be solved using dynamic programming.
This document discusses real numbers and their properties including order of operations and absolute values. It aims to teach students how to evaluate expressions using order of operations, find absolute values of real numbers, and evaluate absolute values using their properties. Specifically, it outlines the steps for order of operations when grouping symbols are and aren't present. It also provides examples of evaluating absolute value expressions and discusses properties of absolute values like the triangle inequality.
This document discusses control flow, functions, and recursion in Python. It begins by defining boolean expressions and explaining different types of operators like arithmetic, relational, logical, and assignment operators. It then covers conditional execution using if, else, and elif statements. Loops like while and for are explained along with break, continue, and pass statements. Functions are described as being able to return values. Finally, recursion is defined as a function calling itself, either directly or indirectly.
This document summarizes an algorithm writing technique using invariants inspired by Professor Dijkstra's style of proving and deriving algorithms. It explains what invariants and predicates are, and how to use Hoare triples to prove correctness of while loops. An example is provided to derive an algorithm to calculate 2^n using an invariant. Exercises are provided to practice deriving algorithms for various problems like calculating sums, finding maximums, sorting arrays, and more using invariants.
The document reviews key concepts about functions including domain, range, and evaluating functions. It provides examples of determining if a relation is a function using mapping diagrams and the vertical line test. It also gives examples of finding the domain and range of functions from graphs and equations. Practice problems are included for students to determine domains, ranges, and evaluate functions.
This document provides an overview of loops and repetition in C programming. It discusses the concept of loops, pre-test and post-test loops, loop initialization and updating, event-controlled and counter-controlled loops. Specific loop constructs in C like while, do-while and for loops are covered. Examples of loop applications like summation, powers, finding minimum and maximum values are also listed. The document serves as an introduction to repetition and looping in C programming.
The 2nd Derivative Test can determine if a critical point is a local maximum or minimum of a function. If the 2nd derivative at a critical point is negative, it is a local maximum, and if positive, it is a local minimum. However, the test does not always work in two scenarios: 1) when the 2nd derivative is zero at a critical point, and 2) when the 2nd derivative is undefined at a critical point, in which case the 1st Derivative Test must be used instead.
The document explains the steps of the Simplex method for solving linear programs: 1) Transform the problem into standard form; 2) Introduce slack variables; 3) Create a Simplex tableau; 4) Use pivot variables and row operations to optimize variables until the optimal solution is found where all objective values are positive. The method involves iteratively creating new tableaus until the optimal values are identified.
The document explains the steps of the Simplex method for solving linear programs: 1) Transform the problem into standard form, 2) Introduce slack variables, 3) Create a Simplex tableau, 4) Check for optimality and identify a pivot variable if not optimal, 5) Create a new tableau to optimize the pivot variable, 6) Repeat until an optimal solution is found, then 7) Identify the optimal values. The Simplex method uses tableaus and pivot variables to iteratively find an optimal solution satisfying all constraints.
This document provides a review of concepts covered in Module 4 including:
1) Direct and inverse variation relationships and examples of each. Direct variation passes through the origin on a graph while inverse variation relates two variables according to a constant product.
2) Converting between radical expressions and rational exponents by applying exponent rules such as exponent is applied to each factor in parentheses or adding exponents of common bases.
3) Explaining the difference between rational and irrational numbers where rational numbers can be expressed as fractions and irrational numbers cannot.
4) Graphing a radical equation, finding the vertex, domain, range, intercepts, and rate of change.
5) Defining extraneous solutions as solutions to
Homework on identifying key properties of functions such as the domain, intercepts, asymptotes, derivative, critical numbers, intervals of increasing/decreasing behavior, extrema, second derivative, points of inflection, and sketching the graph is due the first meeting next week. Instructions provide guidance on analyzing functions to find these properties.
This document discusses functions in C/C++. It covers advantages of functions like modularity and reusability. It explains how to write functions, including return types, passing arguments by value or reference, and function prototypes. Examples demonstrate writing functions to find the maximum of two numbers, square a number, and convert characters to uppercase. The differences between call by value and call by reference are explained using examples. The document also discusses passing structures to functions and returning multiple values or values of different types from functions.
This document provides information about teaching place value to students. It defines key terms like zero, place value, number, and number line. It explains the importance of understanding place value and how it relates to counting and representing numbers on a number line. Activities are suggested, like having students roll dice and write numbers in place value form to understand the meaning of different digit positions. Questions are provided to check understanding, and visual examples like rods divided into pieces are described to illustrate place value concepts. Finally, resources for teachers and additional activities are listed.
The document discusses different types of operators in programming languages like C and C++. It explains that operators take operands as inputs and produce outputs. Common operators covered include arithmetic operators (+, -, *, /, %), unary operators (+, -), increment/decrement operators (++, --), relational operators (<, >, <=, >=, ==, !=), logical operators (&&, ||, !), and others. Examples are provided to demonstrate the usage of each operator. The key purpose of operators is to perform computations on operands through expressions.
The document covers three topics:
1) Composite functions and finding f[g(0)] for a given function.
2) The derivative and its applications, including proving the derivative of a function and finding the equation of a tangent line.
3) Polynomial functions, including finding the y-intercept, x-intercepts, critical points and intervals of increase/decrease to sketch the graph of a polynomial function.
The document discusses dynamic programming and provides examples of problems that can be solved using dynamic programming techniques. It describes characteristics of dynamic programming problems such as overlapping subproblems and optimal substructure properties. It also describes two common approaches to dynamic programming - top-down with memorization and bottom-up with tabulation. Finally, it lists 12 practice problems related to topics like staircase problem, tiling problem, friends pairing problem, house thief problem, minimum jumps problem, Catalan numbers, binomial coefficients, permutation coefficients, subset sum problem, 0/1 knapsack problem, longest common subsequence and edit distance that can be solved using dynamic programming.
This document discusses real numbers and their properties including order of operations and absolute values. It aims to teach students how to evaluate expressions using order of operations, find absolute values of real numbers, and evaluate absolute values using their properties. Specifically, it outlines the steps for order of operations when grouping symbols are and aren't present. It also provides examples of evaluating absolute value expressions and discusses properties of absolute values like the triangle inequality.
This document discusses control flow, functions, and recursion in Python. It begins by defining boolean expressions and explaining different types of operators like arithmetic, relational, logical, and assignment operators. It then covers conditional execution using if, else, and elif statements. Loops like while and for are explained along with break, continue, and pass statements. Functions are described as being able to return values. Finally, recursion is defined as a function calling itself, either directly or indirectly.
This document summarizes an algorithm writing technique using invariants inspired by Professor Dijkstra's style of proving and deriving algorithms. It explains what invariants and predicates are, and how to use Hoare triples to prove correctness of while loops. An example is provided to derive an algorithm to calculate 2^n using an invariant. Exercises are provided to practice deriving algorithms for various problems like calculating sums, finding maximums, sorting arrays, and more using invariants.
The document reviews key concepts about functions including domain, range, and evaluating functions. It provides examples of determining if a relation is a function using mapping diagrams and the vertical line test. It also gives examples of finding the domain and range of functions from graphs and equations. Practice problems are included for students to determine domains, ranges, and evaluate functions.
This document provides an overview of loops and repetition in C programming. It discusses the concept of loops, pre-test and post-test loops, loop initialization and updating, event-controlled and counter-controlled loops. Specific loop constructs in C like while, do-while and for loops are covered. Examples of loop applications like summation, powers, finding minimum and maximum values are also listed. The document serves as an introduction to repetition and looping in C programming.
The 2nd Derivative Test can determine if a critical point is a local maximum or minimum of a function. If the 2nd derivative at a critical point is negative, it is a local maximum, and if positive, it is a local minimum. However, the test does not always work in two scenarios: 1) when the 2nd derivative is zero at a critical point, and 2) when the 2nd derivative is undefined at a critical point, in which case the 1st Derivative Test must be used instead.
How to Build a Maze Solving Robot Using ArduinoCircuitDigest
油
Learn how to make an Arduino-powered robot that can navigate mazes on its own using IR sensors and "Hand on the wall" algorithm.
This step-by-step guide will show you how to build your own maze-solving robot using Arduino UNO, three IR sensors, and basic components that you can easily find in your local electronics shop.
Lecture -3 Cold water supply system.pptxrabiaatif2
油
The presentation on Cold Water Supply explored the fundamental principles of water distribution in buildings. It covered sources of cold water, including municipal supply, wells, and rainwater harvesting. Key components such as storage tanks, pipes, valves, and pumps were discussed for efficient water delivery. Various distribution systems, including direct and indirect supply methods, were analyzed for residential and commercial applications. The presentation emphasized water quality, pressure regulation, and contamination prevention. Common issues like pipe corrosion, leaks, and pressure drops were addressed along with maintenance strategies. Diagrams and case studies illustrated system layouts and best practices for optimal performance.
Air pollution is contamination of the indoor or outdoor environment by any ch...dhanashree78
油
Air pollution is contamination of the indoor or outdoor environment by any chemical, physical or biological agent that modifies the natural characteristics of the atmosphere.
Household combustion devices, motor vehicles, industrial facilities and forest fires are common sources of air pollution. Pollutants of major public health concern include particulate matter, carbon monoxide, ozone, nitrogen dioxide and sulfur dioxide. Outdoor and indoor air pollution cause respiratory and other diseases and are important sources of morbidity and mortality.
WHO data show that almost all of the global population (99%) breathe air that exceeds WHO guideline limits and contains high levels of pollutants, with low- and middle-income countries suffering from the highest exposures.
Air quality is closely linked to the earths climate and ecosystems globally. Many of the drivers of air pollution (i.e. combustion of fossil fuels) are also sources of greenhouse gas emissions. Policies to reduce air pollution, therefore, offer a win-win strategy for both climate and health, lowering the burden of disease attributable to air pollution, as well as contributing to the near- and long-term mitigation of climate change.
Gauges are a Pump's Best Friend - Troubleshooting and Operations - v.07Brian Gongol
油
No reputable doctor would try to conduct a basic physical exam without the help of a stethoscope. That's because the stethoscope is the best tool for gaining a basic "look" inside the key systems of the human body. Gauges perform a similar function for pumping systems, allowing technicians to "see" inside the pump without having to break anything open. Knowing what to do with the information gained takes practice and systemic thinking. This is a primer in how to do that.
Were excited to share our product profile, showcasing our expertise in Industrial Valves, Instrumentation, and Hydraulic & Pneumatic Solutions.
We also supply API-approved valves from globally trusted brands, ensuring top-notch quality and internationally certified solutions. Lets explore valuable business opportunities together!
We specialize in:
Industrial Valves (Gate, Globe, Ball, Butterfly, Check)
Instrumentation (Pressure Gauges, Transmitters, Flow Meters)
Pneumatic Products (Cylinders, Solenoid Valves, Fittings)
As authorized partners of trusted global brands, we deliver high-quality solutions tailored to meet your industrial needs with seamless support.
"Zen and the Art of Industrial Construction"
Once upon a time in Gujarat, Plinth and Roofs was working on a massive industrial shed project. Everything was going smoothlyblueprints were flawless, steel structures were rising, and even the cement was behaving. That is, until...
Meet Ramesh, the Stressed Engineer.
Ramesh was a perfectionist. He measured bolts with the precision of a Swiss watchmaker and treated every steel beam like his own child. But as the deadline approached, Rameshs stress levels skyrocketed.
One day, he called Parul, the total management & marketing mastermind.
Ramesh (panicking): "Parul maam! The roof isn't aligning by 0.2 degrees! This is a disaster!"
Parul (calmly): "Ramesh, have you tried... meditating?"
、 Ramesh: "Meditating? Maam, I have 500 workers on-site, and you want me to sit cross-legged and hum Om?"
Parul: "Exactly. Mystic of Seven can help!"
Reluctantly, Ramesh agreed to a 5-minute guided meditation session.
He closed his eyes.
鏝 He breathed deeply.
He chanted "Om Namah Roofaya" (his custom version of a mantra).
When he opened his eyes, a miracle happened!
ッ His mind was clear.
The roof magically aligned (okay, maybe the team just adjusted it while he was meditating).
And for the first time, Ramesh smiled instead of calculating load capacities in his head.
Lesson Learned: Sometimes, even in industrial construction, a little bit of mindfulness goes a long way.
From that day on, Plinth and Roofs introduced tea breaks with meditation sessions, and productivity skyrocketed!
Moral of the story: "When in doubt, breathe it out!"
#PlinthAndRoofs #MysticOfSeven #ZenConstruction #MindfulEngineering
Integration of Additive Manufacturing (AM) with IoT : A Smart Manufacturing A...ASHISHDESAI85
油
Combining 3D printing with Internet of Things (IoT) enables the creation of smart, connected, and customizable objects that can monitor, control, and optimize their performance, potentially revolutionizing various industries. oT-enabled 3D printers can use sensors to monitor the quality of prints during the printing process. If any defects or deviations from the desired specifications are detected, the printer can adjust its parameters in real time to ensure that the final product meets the required standards.
Best KNow Hydrogen Fuel Production in the World The cost in USD kwh for H2Daniel Donatelli
油
The cost in USD/kwh for H2
Daniel Donatelli
Secure Supplies Group
Index
Introduction - Page 3
The Need for Hydrogen Fueling - Page 5
Pure H2 Fueling Technology - Page 7
Blend Gas Fueling: A Transition Strategy - Page 10
Performance Metrics: H2 vs. Fossil Fuels - Page 12
Cost Analysis and Economic Viability - Page 15
Innovations Driving Leadership - Page 18
Laminar Flame Speed Adjustment
Heat Management Systems
The Donatelli Cycle
Non-Carnot Cycle Applications
Case Studies and Real-World Applications - Page 22
Conclusion: Secure Supplies Leadership in Hydrogen Fueling - Page 27
Preface: The ReGenX Generator innovation operates with a US Patented Frequency Dependent Load Current Delay which delays the creation and storage of created Electromagnetic Field Energy around the exterior of the generator coil. The result is the created and Time Delayed Electromagnetic Field Energy performs any magnitude of Positive Electro-Mechanical Work at infinite efficiency on the generator's Rotating Magnetic Field, increasing its Kinetic Energy and increasing the Kinetic Energy of an EV or ICE Vehicle to any magnitude without requiring any Externally Supplied Input Energy. In Electricity Generation applications the ReGenX Generator innovation now allows all electricity to be generated at infinite efficiency requiring zero Input Energy, zero Input Energy Cost, while producing zero Greenhouse Gas Emissions, zero Air Pollution and zero Nuclear Waste during the Electricity Generation Phase. In Electric Motor operation the ReGen-X Quantum Motor now allows any magnitude of Work to be performed with zero Electric Input Energy.
Demonstration Protocol: The demonstration protocol involves three prototypes;
1. Protytpe #1, demonstrates the ReGenX Generator's Load Current Time Delay when compared to the instantaneous Load Current Sine Wave for a Conventional Generator Coil.
2. In the Conventional Faraday Generator operation the created Electromagnetic Field Energy performs Negative Work at infinite efficiency and it reduces the Kinetic Energy of the system.
3. The Magnitude of the Negative Work / System Kinetic Energy Reduction (in Joules) is equal to the Magnitude of the created Electromagnetic Field Energy (also in Joules).
4. When the Conventional Faraday Generator is placed On-Load, Negative Work is performed and the speed of the system decreases according to Lenz's Law of Induction.
5. In order to maintain the System Speed and the Electric Power magnitude to the Loads, additional Input Power must be supplied to the Prime Mover and additional Mechanical Input Power must be supplied to the Generator's Drive Shaft.
6. For example, if 100 Watts of Electric Power is delivered to the Load by the Faraday Generator, an additional >100 Watts of Mechanical Input Power must be supplied to the Generator's Drive Shaft by the Prime Mover.
7. If 1 MW of Electric Power is delivered to the Load by the Faraday Generator, an additional >1 MW Watts of Mechanical Input Power must be supplied to the Generator's Drive Shaft by the Prime Mover.
8. Generally speaking the ratio is 2 Watts of Mechanical Input Power to every 1 Watt of Electric Output Power generated.
9. The increase in Drive Shaft Mechanical Input Power is provided by the Prime Mover and the Input Energy Source which powers the Prime Mover.
10. In the Heins ReGenX Generator operation the created and Time Delayed Electromagnetic Field Energy performs Positive Work at infinite efficiency and it increases the Kinetic Energy of the system.
2. Critical Numbers
Let be defined at . If or if is undefined at , then is a critical number of .
Note that we require that exists in order for to actually be a critical
number.This is an important, and often overlooked, number.What this is really
saying is that all critical numbers must be in the domain of the function. If a
number is not in the domain of the function then it is not a critical number.
Sometimes critical number and critical point are loosely used
interchangeably, but typically when you're asked to identify a critical point,
you're expected to provide the coordinates of the point (both and ), and a
critical number is just the value: the place on the number line where is zero or
undefined.
Critical Points
3. To find the Critical Points
1. Find the first derivative of the given function.
2. Express the right side of the first derivative equation into factors.
3. Equate to zero and use the zero-factor property to solve for values which are
called the critical numbers.
4. In cases where factors in the right side involves fractions, critical numbers
are those values of that will make the value of to be undefined.
5. Find the value of by substituting the critical numbers found in step 3 and/or
step 4 to the given original function.
6. The coordinates that will be formed are called the critical points.
Critical Points
5. Find the critical points of the function .
Critical Points
0 =
0 =
CN:
CP: :
6. Extrema or Extreme - a term used to collectively refer to the maxima and
minima of a function
Relative Extrema - a term used to collectively refer to relative maxima and
minima
Relative Maximum - a maximum that is greater than any other in the
neighborhood
Relative Minimum - the lesser value than any other in the neighborhood
Absolute Maximum - the greatest value that the function can assume anywhere
in its range
Absolute Minimum - the lowest value that the function can assume anywhere in
its range
Extrema on Interval
7. To find the extrema:
1. Get the critical points.
2. Substitute the left and right endpoints of the interval to the given original
function to find the values of of the corresponding endpoints.
3. Compare the points found in steps 1 and 2.The lowest among the values will
be the minimum number and the highest among the values will be the
maximum number.
4. The ordered pair formed by these minimum and maximum numbers will
correspond to the minimum and maximum points, respectively.These are
called the extrema of the given functions.
Extrema on Interval
8. Find the Extrema of the following functions on the given interval.
Extrema on Interval
CN:
CP:
CP:
Endpoints:
9. Find the Extrema of the following functions on the given interval.
Extrema on Interval
10. Find the Extrema of the following functions on the given interval.
Extrema on Interval
From previous example
Critical Points: ,
Endpoints:
11. Find the Extrema of the following functions on the given interval.
Extrema on Interval
12. First Derivative Test
At a point where ,
-if changes from positive to negative (as increases), is maximum
-if changes from negative to positive, is a minimum
-if does not change sign, is neither a maximum nor a minimum
Note: When using the 1st
Derivative Test, be sure to consider the domain of the
function. (the value of that will make undefined)
First Derivative Test
13. To find the extrema using the First Derivative Test:
1. Determine the critical points.
2. Make a table of 4 rows to test the intervals based on the critical numbers
found in step 1.
Intervals:
Test Value:
Sign of :
Conclusion:
Note: and
First Derivative Test
18. At a point where , and :
-if , is increasing, the curve is concave
upward, assumes the minimum value as
increases
-if , is decreasing, the curve is concave
downward, assumes the maximum value
as increases
Concavity
19. Second Derivative Test
At a point where ,
-if , is a minimum;
-if , is a maximum;
-if , the test fails: use the 1st
Derivative Test to find the maximum and minimum
point
Second Derivative Test
20. To find the extrema using the Second Derivative Test
1. Determine the critical points.
2. Determine .
3. Substitute the critical numbers found in step 1 onto .
4. Check the value of if it is greater than, less than or equal to zero.
5. The extrema are determined based on the value of using the conditions
stated in the previous slide.
Second Derivative Test
21. Examine the following functions for maxima and minima:
Second Derivative Test
From example 5c:
Critical Points: ,
22. Point of Inflection
-is a point at which the curve changes from concave upward to concave
downward or vice versa
-is a point at which vanishes provided changes sign at that point; if vanishes
without changing sign, it is not a point of inflection
Note:
A point where is a maximum or a minimum provided If and both equal to
zero, the point is in general a point of inflection with a horizontal tangent; but if
vanishes without changing sign, the point is a maximum or a minimum.
Points of Inflection
27. Steps in sketching polynomial curves
1. Find the points of intersection with the axes.
2. Find the first derivative and equate it to zero. Solve to find the abscissa of the
maximum and minimum points.Test these values.
3. Find the second derivative and equate to zero. Solve to find the abscissas of
the points of inflection. Test the values.
4. Calculate the corresponding ordinates of the points whose abscissas were
found in the 2nd
and 3rd
steps. Calculate more points as necessary.
5. Plot and sketch the curve.
Curve Sketching
28. Trace the following curve:
Curve Sketching
From previous example :
Critical Points: , ,
Points of Inflection: , ,