
Concept explainers
The box on page 569 summarizes the finance formulas you have worked with throughout the chapter. Where applicable, use the appropriate formula to solve an exercise in this test. Unless otherwise stated, round dollar amounts to the nearest cent and rates to the nearest tenth of a percent.
A CD player with an original price of $120 is on sale at 15% off.
a. What is the amount of the discount?
b. What is the sale price of the CD player?
(a)

To calculate: The value of the discount when price of the CD player is $120, and the discount on the sale is 15%..
Answer to Problem 1T
Solution:$18.
Explanation of Solution
Given: The price of the CD player is $120, and the discount on the sale is 15%.
Calculation:
Compute the value of the discount using the equation as shown below:
(b)

To calculate: The sales price of the CD player when price of the CD player is $120, and the discount on the sale is 15%.
Answer to Problem 1T
Solution:$102.
Explanation of Solution
Given: The price of the CD player is $120, and the discount on the sale is 15%.
Calculation:
Compute the amount of sales price of the CD player using the equation as shown below:
Want to see more full solutions like this?
Chapter 8 Solutions
Thinking Mathematically (6th Edition)
- Question 3 Consider the directed network (D, c) given by the following drawing, where each arc e = A(D) is labelled by its capacity c(e) and two vertices s and t have been identified. 3 7 3 4 5 t 3 3 8 2 (a) Give an s-t-flow of (D, c) that is not a maximum s-t-flow. Justify your answer. (b) Give an s-t-cut of (D, c) that is not a minimum s-t-cut. Justify your answer. (c) Use the Ford-Fulkerson algorithm to find a maximum s-t-flow of (D,c). Draw the residual network after each iteration of the algorithm and give the size of the maximum flow. (d) Show that the flow you have found is indeed a maximum s-t-flow.arrow_forwardQuestion 1 i Let G be the graph given by the following drawing. g a d b (a) Draw the induced subgraph of G on vertex set {a, d, e, f, g, h}. [4] (b) Draw a subgraph of G that is isomorphic to the graph H with V (H) = {r, s, t, u, v, w, x, y, z} and E(H) = {rs, rt, ru, st, sv, tw, ux, vy, wz}. (c) Draw a spanning tree of G whose set of leaves is {a, b, g, j}, or explain why such a spanning tree does not exist. [4] [4] Call a cycle of a graph H a Hamiltonian cycle of H if it contains every vertex of H. (d) Give a Hamiltonian cycle of G, or explain why such a cycle does not exist. Let G be an arbitrary simple graph, n = = |V(G)|, and m = |E(G)|. [4] (e) Assume that the complement of G is connected. Show that m ≤ ½n² − ³n +1. [8]arrow_forwarduse power series to solve the differential equation y''-y'-y=0arrow_forward
- Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALCollege AlgebraAlgebraISBN:9781305115545Author:James Stewart, Lothar Redlin, Saleem WatsonPublisher:Cengage Learning
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage


