Concept explainers
Toxic Dumping in Acidified Lakes. Consider a situation in which acid rain has heavily polluted a lake to a level of pH 4. An unscrupulous chemical company dumps some acid in to the lake illegally Assume that the lake contains 100 million gallons of water and that the company dumps 100,000 gallons of acid with pH 2.
a.What is the hydrogen ion concentration, [H+], of the lake polluted by acid rain alone?
b.Suppose that the unpolluted lake, without acid rain, would have pH 7. If the lake were then polluted by company acid alone (no acid rain), what hydrogen ion concentration, [H+], and pH would it have?
c. What is the hydrogen ion concentration, [H'], after the company dumps the acid into the acid rain-polluted lake (pH 4)? What is the new pH of the lake?
d. If the U.S. Environmental Protection Agency can test for changes in pH of only 0.1 or greater, could the company’s pollution be detected?
Want to see the full answer?
Check out a sample textbook solutionChapter 8 Solutions
Using and Understanding Mathematics: A Quantitative Reasoning Approach plus NEW MyMathLab with Pearson eText -- Access Card Package (6th Edition) (Bennett Science & Math Titles)
- 30. (a) What is meant by the term "product measur"? ANDarrow_forward14. Define X-(H) for a given H E R. Provide a simple example.arrow_forwardLet G be a connected graph with n ≥ 2 vertices. Let A be the adjacency matrix of G. Prove that the diameter of G is the least number d such that all the non-diagonal entries of the matrix A are positive.arrow_forward
- find the general soultion (D-DxDy-2Dx)Z = sin(3x+4y) + x²yarrow_forward3. Show that (a) If X is a random variable, then so is |X|;arrow_forward8. [10 marks] Suppose that 15 people are at a dinner and that each person knows at least 9 of the others. Can the diners be seated around a circular table so that each person knows both of their immediate neighbors? Explain why your answer is correct.arrow_forward
- 19. Let X be a non-negative random variable. Show that lim nE (IX >n)) = 0. E lim (x)-0. = >arrow_forward9. [10 marks] Consider the following graph G. (a) Find the Hamilton closure of G. Explain why your answer is correct. (b) Is G Hamiltonian? Explain why your answer is correct.arrow_forward7. [10 marks] Let G = (V,E) be a 3-connected graph with at least 6 vertices. Let C be a cycle in G of length 5. We show how to find a longer cycle in G. Ꮖ (a) Let x be a vertex of G that is not on C. Show that there are three C-paths Po, P1, P2 that are disjoint except at the shared initial vertex x and only intersect C at their final vertices. (b) Show that at least two of Po, P1, P2 have final vertices that are adjacent along C.arrow_forward
- Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage