For Individual or Group Explorations
Tangent Lines
A line tangent to a parabola must intersect the parabola at exactly one point, as shown in the accompanying figure. Of course, it is impossible to draw a graph that really looks like there is one point of intersection. However, if we find a tangent line algebraically, then we can he sure that it intersects only once.
a) Consider y = x2 and the point (3, 9). If y – 9 = m(x – 3) is tangent to the parabola at (3, 9), then the system
y = x2
y – 9 = m(x – 3)
must have exactly one solution. For what value of m docs the system have exactly one solution?
b) Graph the parabola and the tangent line found in part (a) on a graphing calculator and then use the intersect feature of the calculator to find the point of intersection.
c) There is another line that intersects y = x2 at (3, 9) and only at (3, 9). What is it? Why did it not appear in part (a)?
d) Use the same reasoning as used in part (a) to find the slope of the tangent line to y = x2 at (x1, y1).
e) Use the result of part (d) to find the equation of the tangent line to y = x2 at (–2.5, 6.25).
Want to see the full answer?
Check out a sample textbook solutionChapter 7 Solutions
College Algebra Plus New Mymathlab With Pearson Etext Access Card
Additional Math Textbook Solutions
Pathways To Math Literacy (looseleaf)
Elementary & Intermediate Algebra
Elementary Statistics (13th Edition)
Elementary Statistics ( 3rd International Edition ) Isbn:9781260092561
College Algebra (Collegiate Math)
University Calculus: Early Transcendentals (4th Edition)
- I need diagram with solutionsarrow_forwardT. Determine the least common denominator and the domain for the 2x-3 10 problem: + x²+6x+8 x²+x-12 3 2x 2. Add: + Simplify and 5x+10 x²-2x-8 state the domain. 7 3. Add/Subtract: x+2 1 + x+6 2x+2 4 Simplify and state the domain. x+1 4 4. Subtract: - Simplify 3x-3 x²-3x+2 and state the domain. 1 15 3x-5 5. Add/Subtract: + 2 2x-14 x²-7x Simplify and state the domain.arrow_forwardQ.1) Classify the following statements as a true or false statements: Q a. A simple ring R is simple as a right R-module. b. Every ideal of ZZ is small ideal. very den to is lovaginz c. A nontrivial direct summand of a module cannot be large or small submodule. d. The sum of a finite family of small submodules of a module M is small in M. e. The direct product of a finite family of projective modules is projective f. The sum of a finite family of large submodules of a module M is large in M. g. Zz contains no minimal submodules. h. Qz has no minimal and no maximal submodules. i. Every divisible Z-module is injective. j. Every projective module is a free module. a homomorp cements Q.4) Give an example and explain your claim in each case: a) A module M which has a largest proper submodule, is directly indecomposable. b) A free subset of a module. c) A finite free module. d) A module contains no a direct summand. e) A short split exact sequence of modules.arrow_forward
- Listen ANALYZING RELATIONSHIPS Describe the x-values for which (a) f is increasing or decreasing, (b) f(x) > 0 and (c) f(x) <0. y Af -2 1 2 4x a. The function is increasing when and decreasing whenarrow_forwardBy forming the augmented matrix corresponding to this system of equations and usingGaussian elimination, find the values of t and u that imply the system:(i) is inconsistent.(ii) has infinitely many solutions.(iii) has a unique solutiona=2 b=1arrow_forwardif a=2 and b=1 1) Calculate 49(B-1)2+7B−1AT+7ATB−1+(AT)2 2)Find a matrix C such that (B − 2C)-1=A 3) Find a non-diagonal matrix E ̸= B such that det(AB) = det(AE)arrow_forwardWrite the equation line shown on the graph in slope, intercept form.arrow_forward1.2.15. (!) Let W be a closed walk of length at least 1 that does not contain a cycle. Prove that some edge of W repeats immediately (once in each direction).arrow_forward1.2.18. (!) Let G be the graph whose vertex set is the set of k-tuples with elements in (0, 1), with x adjacent to y if x and y differ in exactly two positions. Determine the number of components of G.arrow_forward1.2.17. (!) Let G,, be the graph whose vertices are the permutations of (1,..., n}, with two permutations a₁, ..., a,, and b₁, ..., b, adjacent if they differ by interchanging a pair of adjacent entries (G3 shown below). Prove that G,, is connected. 132 123 213 312 321 231arrow_forward1.2.19. Let and s be natural numbers. Let G be the simple graph with vertex set Vo... V„−1 such that v; ↔ v; if and only if |ji| Є (r,s). Prove that S has exactly k components, where k is the greatest common divisor of {n, r,s}.arrow_forward1.2.20. (!) Let u be a cut-vertex of a simple graph G. Prove that G - v is connected. עarrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
- Elementary Geometry For College Students, 7eGeometryISBN:9781337614085Author:Alexander, Daniel C.; Koeberlein, Geralyn M.Publisher:Cengage,Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:CengageTrigonometry (MindTap Course List)TrigonometryISBN:9781305652224Author:Charles P. McKeague, Mark D. TurnerPublisher:Cengage Learning
- Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage LearningTrigonometry (MindTap Course List)TrigonometryISBN:9781337278461Author:Ron LarsonPublisher:Cengage Learning