Concept explainers
a)
To evaluate: the fraction of the house can Tim paint in one day and the fraction of the house can Tara paint in one day.
a)
Answer to Problem 68PPE
Fraction of house, Tim can paint in one day is
Fraction of house, Tara can paint in one day is
Explanation of Solution
Given:
Tim can paint a house in 6 days. Tara can paint the same house in 3 days.
To find the fraction, Tim can paint in one day,
So, the fraction, Tim can paint in one day is
To find the fraction, Tara can paint in one day,
So, the fraction, Tara can paint in one day is
b)
To evaluate: the fraction of the house can Tim paint in‘d’ days and the fraction of the house can Tara paint in‘d’ days.
b)
Answer to Problem 68PPE
Fraction of house, Tim can paint in ‘d’ days is
Fraction of house, Tara can paint in ‘d’ days is
Explanation of Solution
Given:
Tim can paint a house in 6 days. Tara can paint the same house in 3 days.
To find the fraction, Tim can paint in one day,
So, the fraction, Tim can paint in ‘d’ days is
To find the fraction, Tara can paint in one day,
So, the fraction, Tara can paint in ‘d’ day is
c)
To evaluate: the fraction of the house can Tim and Tara together can paint in 1 day and the fraction of the house can Tim and Tara together can paint in ‘d’ day.
c)
Answer to Problem 68PPE
Fraction of house, Tim can paint in ‘d’ days is
Fraction of house, Tara can paint in ‘d’ days is
Explanation of Solution
Given:
Tim can paint a house in 6 days. Tara can paint the same house in 3 days.
To find the fraction, Tim can paint in one day,
To find the fraction, Tara can paint in one day,
So, the fraction, Tim and Tara can paint in a day is
The fraction, Tim can paint in ‘d’ days is
The fraction, Tara can paint in ‘d’ days is
So, the fraction, Tim and Tara can paint in ‘d’ days is
d)
To evaluate: the solution of the equation to find the number of days it will take Tim and Tara to paint the whole house working together.
d)
Answer to Problem 68PPE
The total number of days, Tim and Tara can paint the whole house is 2 days.
Explanation of Solution
Given:
Tim can paint a house in 6 days. Tara can paint the same house in 3 days.
To find the fraction, Tim can paint in one day,
To find the fraction, Tara can paint in one day,
So, the fraction, Tim and Tara can paint in a day is
The total number of days, Tim and Tara can paint the whole house is 2 days.
Chapter 2 Solutions
High School Math 2011 Algebra 1(prentice Hall) Student Edition
Additional Math Textbook Solutions
Elementary Statistics: Picturing the World (7th Edition)
College Algebra with Modeling & Visualization (5th Edition)
Elementary Statistics
Basic Business Statistics, Student Value Edition
Intro Stats, Books a la Carte Edition (5th 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 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