The braking distance required for a car to stop depends on numerous variables such as the speed of the car, the weight of the car, reaction time of the driver, and the coefficient of friction between the tires and the road. For a certain vehicle on one stretch of highway, the braking distances
s | 30 | 35 | 40 | 45 | 50 |
|
109 | 134 | 162 | 191 | 223 |
s | 55 | 60 | 65 | 70 | 75 |
|
256 | 291 | 328 | 368 | 409 |
a. Use regression to find a quadratic function to model the data.
b. Use the model from part (a ) to predict the stopping distance for the car if it is traveling 62 mph before the brakes are applied. Round to the nearest foot.
c. Suppose that the car is traveling 53 mph before the brakes are applied. If a deer is standing in the road at a distance of 245 ft from the point where the brakes are applied, will the car hit the deer?
Want to see the full answer?
Check out a sample textbook solutionChapter 3 Solutions
College Algebra Second Edition
- Write 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_forward
- 1.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_forward
- 1.2.12. (-) Convert the proof at 1.2.32 to an procedure for finding an Eulerian circuit in a connected even graph.arrow_forward1.2.16. Let e be an edge appearing an odd number of times in a closed walk W. Prove that W contains the edges of a cycle through c.arrow_forward1.2.11. (−) Prove or disprove: If G is an Eulerian graph with edges e, f that share vertex, then G has an Eulerian circuit in which e, f appear consecutively. aarrow_forward
- By 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_forward1.2.6. (-) In the graph below (the paw), find all the maximal paths, maximal cliques, and maximal independent sets. Also find all the maximum paths, maximum cliques, and maximum independent sets.arrow_forward1.2.13. Alternative proofs that every u, v-walk contains a u, v-path (Lemma 1.2.5). a) (ordinary induction) Given that every walk of length 1-1 contains a path from its first vertex to its last, prove that every walk of length / also satisfies this. b) (extremality) Given a u, v-walk W, consider a shortest u, u-walk contained in W.arrow_forward
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:CengageAlgebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
- Trigonometry (MindTap Course List)TrigonometryISBN:9781337278461Author:Ron LarsonPublisher:Cengage LearningBig Ideas Math A Bridge To Success Algebra 1: Stu...AlgebraISBN:9781680331141Author:HOUGHTON MIFFLIN HARCOURTPublisher:Houghton Mifflin HarcourtGlencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw Hill