DISCRETE MATHEMATICS WITH APPLICATION (
5th Edition
ISBN: 9780357097717
Author: EPP
Publisher: CENGAGE L
expand_more
expand_more
format_list_bulleted
Videos
Question
Chapter 11.4, Problem 8ES
To determine
Graph each function defined below:
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Two functions are given below: f(x) and h(x). State the axis of symmetry for each function and explain how to find it.
f(x)
h(x)
21
5
4+
3
f(x) = −2(x − 4)² +2
+
-5 -4-3-2-1
1
2
3
4
5
-1
-2
-3
5
The functions f(x) = (x + 1)² - 2 and g(x) = (x-2)² + 1 have been rewritten using the completing-the-square method. Apply your knowledge of functions in vertex form to determine if the vertex for each function is a minimum or a
maximum and explain your reasoning.
Total marks 15
3.
(i)
Let FRN Rm be a mapping and x = RN is a given
point. Which of the following statements are true? Construct counterex-
amples for any that are false.
(a)
If F is continuous at x then F is differentiable at x.
(b)
If F is differentiable at x then F is continuous at x.
If F is differentiable at x then F has all 1st order partial
(c)
derivatives at x.
(d) If all 1st order partial derivatives of F exist and are con-
tinuous on RN then F is differentiable at x.
[5 Marks]
(ii) Let mappings
F= (F1, F2) R³ → R² and
G=(G1, G2) R² → R²
:
be defined by
F₁ (x1, x2, x3) = x1 + x²,
G1(1, 2) = 31,
F2(x1, x2, x3) = x² + x3,
G2(1, 2)=sin(1+ y2).
By using the chain rule, calculate the Jacobian matrix of the mapping
GoF R3 R²,
i.e., JGoF(x1, x2, x3). What is JGOF(0, 0, 0)?
(iii)
[7 Marks]
Give reasons why the mapping Go F is differentiable at
(0, 0, 0) R³ and determine the derivative matrix D(GF)(0, 0, 0).
[3 Marks]
Chapter 11 Solutions
DISCRETE MATHEMATICS WITH APPLICATION (
Ch. 11.1 - If f is a real-valued function of a real variable,...Ch. 11.1 - Prob. 2TYCh. 11.1 - Prob. 3TYCh. 11.1 - Prob. 4TYCh. 11.1 - Prob. 5TYCh. 11.1 - Prob. 6TYCh. 11.1 - Prob. 1ESCh. 11.1 - The graph of a function g is shown below. a. Is...Ch. 11.1 - Prob. 3ESCh. 11.1 - Sketch the graphs of the power functions p3 and p4...
Ch. 11.1 - Prob. 5ESCh. 11.1 - Prob. 6ESCh. 11.1 - Prob. 7ESCh. 11.1 - Sketch a graph for each of the functions defined...Ch. 11.1 - Prob. 9ESCh. 11.1 - Prob. 10ESCh. 11.1 - Prob. 11ESCh. 11.1 - Prob. 12ESCh. 11.1 - Prob. 13ESCh. 11.1 - The graph of a function f is shown below. Find the...Ch. 11.1 - Prob. 15ESCh. 11.1 - Prob. 16ESCh. 11.1 - Prob. 17ESCh. 11.1 - Prob. 18ESCh. 11.1 - Prob. 19ESCh. 11.1 - Prob. 20ESCh. 11.1 - Prob. 21ESCh. 11.1 - Prob. 22ESCh. 11.1 - Prob. 23ESCh. 11.1 - Prob. 24ESCh. 11.1 - Prob. 25ESCh. 11.1 - Prob. 26ESCh. 11.1 - Prob. 27ESCh. 11.1 - Prob. 28ESCh. 11.2 - A sentence of the form Ag(n)f(n) for every na...Ch. 11.2 - Prob. 2TYCh. 11.2 - Prob. 3TYCh. 11.2 - When n1,n n2 and n2 n5__________.Ch. 11.2 - Prob. 5TYCh. 11.2 - Prob. 6TYCh. 11.2 - Prob. 1ESCh. 11.2 - Prob. 2ESCh. 11.2 - The following is a formal definition for ...Ch. 11.2 - In 4—9, express each statement using -, O-, or ...Ch. 11.2 - In 4—9, express each statement using -, O-, or ...Ch. 11.2 - Prob. 6ESCh. 11.2 - Prob. 7ESCh. 11.2 - Prob. 8ESCh. 11.2 - Prob. 9ESCh. 11.2 - Prob. 10ESCh. 11.2 - Prob. 11ESCh. 11.2 - Prob. 12ESCh. 11.2 - Prob. 13ESCh. 11.2 - Use the definition of -notation to show that...Ch. 11.2 - Prob. 15ESCh. 11.2 - Prob. 16ESCh. 11.2 - Prob. 17ESCh. 11.2 - Prob. 18ESCh. 11.2 - Prob. 19ESCh. 11.2 - Prob. 20ESCh. 11.2 - Prove Theorem 11.2.4: If f is a real-valued...Ch. 11.2 - Prob. 22ESCh. 11.2 - Prob. 23ESCh. 11.2 - a. Use one of the methods of Example 11.2.4 to...Ch. 11.2 - Suppose P(n)=amnm+am1nm1++a2n2+a1n+a0 , where all...Ch. 11.2 - Prob. 26ESCh. 11.2 - Prob. 27ESCh. 11.2 - Prob. 28ESCh. 11.2 - Use the theorem on polynomial orders to prove each...Ch. 11.2 - Prob. 30ESCh. 11.2 - Prob. 31ESCh. 11.2 - Prob. 32ESCh. 11.2 - Prove each of the statements in 32—39. Use the...Ch. 11.2 - Prob. 34ESCh. 11.2 - Prob. 35ESCh. 11.2 - Prob. 36ESCh. 11.2 - Prob. 37ESCh. 11.2 - Prob. 38ESCh. 11.2 - Prob. 39ESCh. 11.2 - Prob. 40ESCh. 11.2 - Prob. 41ESCh. 11.2 - Prob. 42ESCh. 11.2 - Prob. 43ESCh. 11.2 - Prob. 44ESCh. 11.2 - Prob. 45ESCh. 11.2 - Prob. 46ESCh. 11.2 - Prob. 47ESCh. 11.2 - Prob. 48ESCh. 11.2 - Prob. 49ESCh. 11.2 - Prob. 50ESCh. 11.2 - Prob. 51ESCh. 11.3 - When an algorithm segment contains a nested...Ch. 11.3 - Prob. 2TYCh. 11.3 - Prob. 3TYCh. 11.3 - Suppose a computer takes 1 nanosecond ( =109...Ch. 11.3 - Prob. 2ESCh. 11.3 - Prob. 3ESCh. 11.3 - Exercises 4—5 explore the fact that for relatively...Ch. 11.3 - Prob. 5ESCh. 11.3 - Prob. 6ESCh. 11.3 - Prob. 7ESCh. 11.3 - Prob. 8ESCh. 11.3 - Prob. 9ESCh. 11.3 - For each of the algorithm segments in 6—19, assume...Ch. 11.3 - For each of the algorithm segments in 6—19, assume...Ch. 11.3 - For each of the algorithm segments in 6—19, assume...Ch. 11.3 - Prob. 13ESCh. 11.3 - Prob. 14ESCh. 11.3 - For each of the algorithm segments in 6—19, assume...Ch. 11.3 - Prob. 16ESCh. 11.3 - For each of the algorithm segments in 6—19, assume...Ch. 11.3 - Prob. 18ESCh. 11.3 - Prob. 19ESCh. 11.3 - Prob. 20ESCh. 11.3 - Prob. 21ESCh. 11.3 - Construct a trace table showing the action of...Ch. 11.3 - Construct a trace table showing the action of...Ch. 11.3 - Prob. 24ESCh. 11.3 - Prob. 25ESCh. 11.3 - Prob. 26ESCh. 11.3 - Consider the recurrence relation that arose in...Ch. 11.3 - Prob. 28ESCh. 11.3 - Prob. 29ESCh. 11.3 - Exercises 28—35 refer to selection sort, which is...Ch. 11.3 - Prob. 31ESCh. 11.3 - Prob. 32ESCh. 11.3 - Prob. 33ESCh. 11.3 - Prob. 34ESCh. 11.3 - Prob. 35ESCh. 11.3 - Prob. 36ESCh. 11.3 - Prob. 37ESCh. 11.3 - Prob. 38ESCh. 11.3 - Prob. 39ESCh. 11.3 - Prob. 40ESCh. 11.3 - Prob. 41ESCh. 11.3 - Exercises 40—43 refer to another algorithm, known...Ch. 11.3 - Prob. 43ESCh. 11.4 - The domain of any exponential function is , and...Ch. 11.4 - Prob. 2TYCh. 11.4 - Prob. 3TYCh. 11.4 - Prob. 4TYCh. 11.4 - Prob. 5TYCh. 11.4 - Graph each function defined in 1-8. 1. f(x)=3x for...Ch. 11.4 - Prob. 2ESCh. 11.4 - Prob. 3ESCh. 11.4 - Prob. 4ESCh. 11.4 - Prob. 5ESCh. 11.4 - Prob. 6ESCh. 11.4 - Prob. 7ESCh. 11.4 - Prob. 8ESCh. 11.4 - Prob. 9ESCh. 11.4 - Prob. 10ESCh. 11.4 - Prob. 11ESCh. 11.4 - Prob. 12ESCh. 11.4 - Prob. 13ESCh. 11.4 - Prob. 14ESCh. 11.4 - Prob. 15ESCh. 11.4 - Prob. 16ESCh. 11.4 - Prob. 17ESCh. 11.4 - Prob. 18ESCh. 11.4 - Prob. 19ESCh. 11.4 - Prob. 20ESCh. 11.4 - Prob. 21ESCh. 11.4 - Prob. 22ESCh. 11.4 - Prob. 23ESCh. 11.4 - Prob. 24ESCh. 11.4 - Prob. 25ESCh. 11.4 - Prob. 26ESCh. 11.4 - Prob. 27ESCh. 11.4 - Prob. 28ESCh. 11.4 - Prob. 29ESCh. 11.4 - Prob. 30ESCh. 11.4 - Prob. 31ESCh. 11.4 - Prob. 32ESCh. 11.4 - Prove each of the statements in 32—37, assuming n...Ch. 11.4 - Prob. 34ESCh. 11.4 - Prob. 35ESCh. 11.4 - Prob. 36ESCh. 11.4 - Prob. 37ESCh. 11.4 - Prob. 38ESCh. 11.4 - Prob. 39ESCh. 11.4 - Prob. 40ESCh. 11.4 - Show that log2n is (log2n) .Ch. 11.4 - Prob. 42ESCh. 11.4 - Prob. 43ESCh. 11.4 - Prob. 44ESCh. 11.4 - Prob. 45ESCh. 11.4 - Prob. 46ESCh. 11.4 - Prob. 47ESCh. 11.4 - Prob. 48ESCh. 11.4 - Prob. 49ESCh. 11.4 - Prob. 50ESCh. 11.4 - Prob. 51ESCh. 11.5 - Prob. 1TYCh. 11.5 - To search an array using the binary search...Ch. 11.5 - Prob. 3TYCh. 11.5 - Prob. 4TYCh. 11.5 - The worst-case order of the merge sort algorithm...Ch. 11.5 - Prob. 1ESCh. 11.5 - Prob. 2ESCh. 11.5 - Prob. 3ESCh. 11.5 - Prob. 4ESCh. 11.5 - In 5 and 6, trace the action of the binary search...Ch. 11.5 - Prob. 6ESCh. 11.5 - Prob. 7ESCh. 11.5 - Prob. 8ESCh. 11.5 - Prob. 9ESCh. 11.5 - Prob. 10ESCh. 11.5 - Prob. 11ESCh. 11.5 - Prob. 12ESCh. 11.5 - Prob. 13ESCh. 11.5 - Prob. 14ESCh. 11.5 - Prob. 15ESCh. 11.5 - Prob. 16ESCh. 11.5 - Trace the modified binary search algorithm for the...Ch. 11.5 - Prob. 18ESCh. 11.5 - Prob. 19ESCh. 11.5 - Prob. 20ESCh. 11.5 - Prob. 21ESCh. 11.5 - Prob. 22ESCh. 11.5 - Prob. 23ESCh. 11.5 - Show that given an array a[bot],a[bot+1],,a[top]of...Ch. 11.5 - Prob. 25ESCh. 11.5 - Prob. 26ES
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- 5. (i) Let f R2 R be defined by f(x1, x2) = x² - 4x1x2 + 2x3. Find all local minima of f on R². (ii) [10 Marks] Give an example of a function f: R2 R which is not bounded above and has exactly one critical point, which is a minimum. Justify briefly Total marks 15 your answer. [5 Marks]arrow_forwardTotal marks 15 4. : Let f R2 R be defined by f(x1, x2) = 2x²- 8x1x2+4x+2. Find all local minima of f on R². [10 Marks] (ii) Give an example of a function f R2 R which is neither bounded below nor bounded above, and has no critical point. Justify briefly your answer. [5 Marks]arrow_forward4. Let F RNR be a mapping. (i) x ЄRN ? (ii) : What does it mean to say that F is differentiable at a point [1 Mark] In Theorem 5.4 in the Lecture Notes we proved that if F is differentiable at a point x E RN then F is continuous at x. Proof. Let (n) CRN be a sequence such that xn → x ЄERN as n → ∞. We want to show that F(xn) F(x), which means F is continuous at x. Denote hnxn - x, so that ||hn|| 0. Thus we find ||F(xn) − F(x)|| = ||F(x + hn) − F(x)|| * ||DF (x)hn + R(hn) || (**) ||DF(x)hn||+||R(hn)||| → 0, because the linear mapping DF(x) is continuous and for all large nЄ N, (***) ||R(hn) || ||R(hn) || ≤ → 0. ||hn|| (a) Explain in details why ||hn|| → 0. [3 Marks] (b) Explain the steps labelled (*), (**), (***). [6 Marks]arrow_forward
- 4. In Theorem 5.4 in the Lecture Notes we proved that if F: RN → Rm is differentiable at x = RN then F is continuous at x. Proof. Let (xn) CRN be a sequence such that x → x Є RN as n → ∞. We want F(x), which means F is continuous at x. to show that F(xn) Denote hn xnx, so that ||hn||| 0. Thus we find ||F (xn) − F(x) || (*) ||F(x + hn) − F(x)|| = ||DF(x)hn + R(hn)|| (**) ||DF(x)hn|| + ||R(hn) || → 0, because the linear mapping DF(x) is continuous and for all large n = N, |||R(hn) || ≤ (***) ||R(hn)|| ||hn|| → 0. Explain the steps labelled (*), (**), (***) [6 Marks] (ii) Give an example of a function F: RR such that F is contin- Total marks 10 uous at x=0 but F is not differentiable at at x = 0. [4 Marks]arrow_forward3. Let f R2 R be a function. (i) Explain in your own words the relationship between the existence of all partial derivatives of f and differentiability of f at a point x = R². (ii) Consider R2 → R defined by : [5 Marks] f(x1, x2) = |2x1x2|1/2 Show that af af -(0,0) = 0 and -(0, 0) = 0, Jx1 მx2 but f is not differentiable at (0,0). [10 Marks]arrow_forward13) Consider the checkerboard arrangement shown below. Assume that the red checker can move diagonally upward, one square at a time, on the white squares. It may not enter a square if occupied by another checker, but may jump over it. How many routes are there for the red checker to the top of the board?arrow_forward
- Fill in the blanks to describe squares. The square of a number is that number Question Blank 1 of 4 . The square of negative 12 is written as Question Blank 2 of 4 , but the opposite of the square of 12 is written as Question Blank 3 of 4 . 2 • 2 = 4. Another number that can be multiplied by itself to equal 4 is Question Blank 4 of 4 .arrow_forward12) The prime factors of 1365 are 3, 5, 7 and 13. Determine the total number of divisors of 1365.arrow_forward11) What is the sum of numbers in row #8 of Pascal's Triangle?arrow_forward
- 14) Seven students and three teachers wish to join a committee. Four of them will be selected by the school administration. What is the probability that three students and one teacher will be selected?arrow_forward(1) Write the following quadratic equation in terms of the vertex coordinates.arrow_forwardNo chatgpt pls will upvote Already got wrong chatgpt answerarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
College AlgebraAlgebraISBN:9781305115545Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage Learning
Trigonometry (MindTap Course List)TrigonometryISBN:9781337278461Author:Ron LarsonPublisher:Cengage Learning
College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
College Algebra
Algebra
ISBN:9781305115545
Author:James Stewart, Lothar Redlin, Saleem Watson
Publisher:Cengage Learning
Trigonometry (MindTap Course List)
Trigonometry
ISBN:9781337278461
Author:Ron Larson
Publisher:Cengage Learning
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning
Power Series; Author: Professor Dave Explains;https://www.youtube.com/watch?v=OxVBT83x8oc;License: Standard YouTube License, CC-BY
Power Series & Intervals of Convergence; Author: Dr. Trefor Bazett;https://www.youtube.com/watch?v=XHoRBh4hQNU;License: Standard YouTube License, CC-BY