a.
To find:Expression for Amanda’s total weekly earnings.
a.
Answer to Problem 17STP
Total weekly earnings
Explanation of Solution
Given information:
Amanda earns
Amanda’s hours at her summer job for one week are listed in the table.
Given
Amanda earns
Amanda’s hours at her summer job for one week are listed in the table.
Number of hours she works on Sunday
Number of hours she works on Monday
Number of hours she works on Tuesday
Number of hours she works on Wednesday
Number of hours she works on Thursday
Number of hours she works on Friday
Number of hours she works on Saturday
For each Hour she earns
Therefore,
Total weekly earnings
Therefore,
Expression for Total weekly earnings
Total weekly earnings
b.
To find: Evaluate the expression from part a by using Distributive Property.
b.
Answer to Problem 17STP
Total Weekly earnings of Amada
Explanation of Solution
Given information:
Amanda earns
Amanda’s hours at her summer job for one week are listed in the table.
We got
Total weekly earnings
On simplifying using Distributive property
We get
Therefore,
Total Weekly earnings of Amada
c.
To find:How many more hours Michael worked than Amanda.
c.
Answer to Problem 17STP
Michael works
Explanation of Solution
Given information:
Amanda earns
Amanda’s hours at her summer job for one week are listed in the table.
Michael earns
Michael total weekly earnings
Given
Amanda earns
Amanda’s hours at her summer job for one week are listed in the table.
Number of hours she works on Sunday
Number of hours she works on Monday
Number of hours she works on Tuesday
Number of hours she works on Wednesday
Number of hours she works on Thursday
Number of hours she works on Friday
Number of hours she works on Saturday
Therefore,
Total hours Amanda works
Michael earns
Michael total weekly earnings
Let
We know
Total weekly earnings
Therefore,
Michael works
Whereas Amanda works
Therefore,
Difference
Therefore,
Michael works
Chapter 13 Solutions
Algebra 2
Additional Math Textbook Solutions
Algebra and Trigonometry (6th Edition)
Elementary Statistics (13th Edition)
A First Course in Probability (10th Edition)
Basic Business Statistics, Student Value Edition
A Problem Solving Approach To Mathematics For Elementary School Teachers (13th 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