(a)
The graph of the system of linear inequalities that represents the situation.
(a)
Answer to Problem 30E
Explanation of Solution
Given information:
You earn $10 per hour working as a manager at a grocery store. You are required to work at the grocery store at least 8 hours per week. You also teach music lessons for $15 per hour you also teach to earn at least $120 per week. but you do not want to work more than 20 hours per week.
Formula used:
Substitution method is used.
Calculation:
Let:
Set up the inequalities:
Working time no more than 20 hours
Earnings of at least $120
Required to work at least 8 hours at the grocery store
Restrict the graph to positive x & y values since negative values do not make sense in this real-life context.
Graph the equations:
The solution is the intersection:
Conclusion:
Restrict the graph to positive x & y values since negative values do not make sense in this real-life context.
(b)
the solution of the system.
(b)
Answer to Problem 30E
Hours working at the grocery store & 4 hours teaching music lessons
Explanation of Solution
Given information:
You earn $10 per hour working as a manager at a grocery store. You are required to work at the grocery store at least 8 hours per week. You also teach music lessons for $15 per hour you also teach to earn at least $120 per week. but you do not want to work more than 20 hours per week.
Formula used:
Substitution method is used
Calculation:
Conclusion:
Hours working at the grocery store & 4 hours teaching music lessons
(c)
To work 8 hours in grocery store to teach 1 hour music lesson.
(c)
Answer to Problem 30E
The point (8, 1) is NOT on the shaded region.
Explanation of Solution
Given information:
You earn $10 per hour working as a manager at a grocery store. You are required to work at the grocery store at least 8 hours per week. You also teach music lessons for $15 per hour you also teach to earn at least $120 per week. but you do not want to work more than 20 hours per week.
Formula used:
Substitution method is used
Calculation:
No, because point (8, 1) is NOT on the shaded region.
Conclusion:
No, because point (8, 1) is NOT on the shaded region.
Chapter 5 Solutions
Big Ideas Math A Bridge To Success Algebra 1: Student Edition 2015
- 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