Write the process of solving and linear graphing.
Answer to Problem 55HP
Explanation of Solution
Concept Used:
Rules for solving inequality equations:
These things do not affect the direction of the inequality:
- Add (or subtract) a number from both sides
- Multiply (or divide) both sides by a positive number
- Simplify a side
But these things do change the direction of the inequality ("
- Multiply (or divide) both sides by a negative number
- Swapping left and right hand sides
For Inequality equation: If
Example:
Steps | Explanation |
Original equation Subtract 14 from both sides. Divide each side by 2 Solution:
| |
Original Equation Subtract 7x from both sides.
|
Here is a summary of how to graph inequalities:
1) Draw a number line.2) Put either an open circle or a closed dot above the number given.
For ≤ and ≥ , use a closed dot to indicate the number itself is part of the solution.
For < and >, use an open circle to indicate the number itself is not part of the solution.
3) Choose which way the arrow should go. Either think about which numbers would be part of the solution. Or, as long as the variable is listed first, you can just look at the symbol
For ≤ and <, the arrow points down to the left.
For ≥ and >, the arrow points up to the right.
Plotting inequalities: To plot an inequality: Such as x>3, on a number line, first draw a circle over the number (e.g., 3). Then if the sign includes equal to (= or =), fill in the circle (solid circle). If the sign does not include equal to (> or <), leave the circle (hollow circle) unfilled in. For x < 3 or x >3, there is a hollow circle. For |
Thus, solving linear inequalities is similar to solving linear equations. You must isolate the variable on one side of the inequality.
To graph, if the problem is a less than or a greater than inequality, an open circle is used. Otherwise a dot is used.
If the variable is on the left hand side of the inequality, and the inequality sign is less than (or less than or equal to), the graph extends to the left; otherwise it extends to the right.
Chapter 5 Solutions
Algebra 1
Additional Math Textbook Solutions
Elementary Statistics (13th Edition)
Introductory Statistics
Elementary Statistics: Picturing the World (7th Edition)
Calculus: Early Transcendentals (2nd Edition)
A Problem Solving Approach To Mathematics For Elementary School Teachers (13th Edition)
Pre-Algebra Student Edition
- 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_forward1.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_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
- Algebra and Trigonometry (6th Edition)AlgebraISBN:9780134463216Author:Robert F. BlitzerPublisher:PEARSONContemporary Abstract AlgebraAlgebraISBN:9781305657960Author:Joseph GallianPublisher:Cengage LearningLinear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
- Algebra And Trigonometry (11th Edition)AlgebraISBN:9780135163078Author:Michael SullivanPublisher:PEARSONIntroduction to Linear Algebra, Fifth EditionAlgebraISBN:9780980232776Author:Gilbert StrangPublisher:Wellesley-Cambridge PressCollege Algebra (Collegiate Math)AlgebraISBN:9780077836344Author:Julie Miller, Donna GerkenPublisher:McGraw-Hill Education