Questions About This Book?
- The Used copy of this book is not guaranteed to include any supplemental materials. Typically, only the book itself is included.
- The Rental copy of this book is not guaranteed to include any supplemental materials. You may receive a brand new copy, but typically, only the book itself.
Larry Goldstein has received several distinguished teaching awards, given more than fifty Conference and Colloquium talks & addresses, and written more than fifty books in math and computer programming. He received his PhD at Princeton and his BA and MA at the University of Pennsylvania. He also teaches part time at Drexel University.
David Schneider, who is known widely for his tutorial software, holds a BA degree from Oberlin College and a PhD from MIT. He is currently an associate professor of mathematics at the University of Maryland. He has authored eight widely used math texts, fourteen highly acclaimed computer books, and three widely used mathematics software packages. He has also produced instructional videotapes at both the University of Maryland and the BBC.
Martha Siegel holds a BA from Russell Sage College, attended Rensselear Polytechnic Institute as a special student, and received his PhD at the University of Rochester. From 1966 until 1971 she taught at Goucher University in Baltimore. Since 1971 she has been a professor at Towson State University, also in Maryland. Professor Siegel has been on the writing team of this book since the fifth edition and is also the co-author of a precalculus reform book.
Table of Contents
|Normal 0 false false false?|
|Index of Applications|
|Linear Equations and Straight Lines|
|Coordinate Systems and Graphs|
|The Intersection Point of a Pair of Lines|
|The Slope of a Straight Line|
|The Method of Least Squares|
|Solving Systems of Linear Equations, I|
|Solving Systems of Linear Equations, II|
|Arithmetic Operations on Matrices|
|The Inverse of a Matrix|
|The Gauss-Jordan Method for Calculating Inverses|
|Linear Programming, A Geometric Approach|
|A Linear Programming Problem|
|Linear Programming, I|
|Linear Programming, II|
|The Simplex Method|
|Slack Variables and the Simplex Tableau|
|The Simplex Method, I: Maximum Problems|
|The Simplex Method, II: Minimum Problems|
|Sensitivity Analysis and Matrix Formulations of Linear Programming Problems|
|Sets and Counting|
|A Fundamental Principle of Counting|
|Venn Diagrams and Counting|
|The Multiplication Principle|
|Permutations and Combinations|
|Further Counting Problems|
|The Binomial Theorem|
|Multinomial Coefficients and Partitions|
|Experiments, Outcomes, Samples and Events|
|Assignment of Probabilities|
|Calculating Probabilities of Events|
|Conditional Probability and Independence|
|Probability and Statistics|
|Representation of Data|
|Frequency and Probability Distributions|
|The Variance and Standard Deviation|
|The Normal Distribution|
|Normal Approximation to the Binomial Distribution|
|An Unexpected Expected Value|
|Table of Contents provided by Publisher. All Rights Reserved.|