External
Applied Finite Mathematics
This text covers topics including linear equations, matrices, linear programming, the mathematics of finance, sets and counting, probability, Markov chains, and game theory. Finite Math covers a variety of topics united by their focus on mathematical techniques used in business applications. The growing field of “business analytics” encompasses many types of applications; the text gives insight to some methods used in industry, although we will explore them on a smaller scale.
- Author
- Rupinder Sekhon and Roberta Bloom
- Publisher
- De Anza College
- Source
- LibreTexts
- License
- CC BY
- Language
- EN
- Category
- Basic Sciences
Contents· 122 sections
- 01: Linear Equations
- 1.01: Graphing a Linear Equation
- 1.1.01: Graphing a Linear Equation (Exercises)
- 1.02: Slope of a Line
- 1.2.01: Slope of a Line (Exercises)
- 1.03: Determining the Equation of a Line
- 1.3.01: Determining the Equation of a Line (Exercises)
- 1.04: Applications
- 1.4.01: Applications (Exercises)
- 1.05: More Applications
- 1.5.01: More Applications (Exercises)
- 1.06: Chapter Review
- 02: Matrices
- 2.01: Introduction to Matrices
- 2.1.01: Introduction to Matrices (Exercises)
- 2.02: Systems of Linear Equations and the Gauss-Jordan Method
- 2.2.01: Systems of Linear Equations and the Gauss-Jordan Method (Exercises)
- 2.03: Systems of Linear Equations Special Cases
- 2.3.01: Systems of Linear Equations Special Cases (Exercises)
- 2.04: Inverse Matrices
- 2.4.01: Inverse Matrices (Exercises)
- 2.05: Application of Matrices in Cryptography
- 2.5.01: Application of Matrices in Cryptography (Exercises)
- 2.06: Applications Leontief Models
- 2.6.01: Applications Leontief Models (Exercises)
- 2.07: Chapter Review
- 03: Linear Programming - A Geometric Approach
- 3.01: Maximization Applications
- 3.1.01: Maximization Applications (Exercises)
- 3.02: Minimization Applications
- 3.2.01: Minimization Applications (Exercises)
- 3.03: Chapter Review
- 04: Linear Programming The Simplex Method
- 4.01: Introduction to Linear Programming Applications in Business Finance Medicine and Social Science
- 4.02: Maximization By The Simplex Method
- 4.2.01: Maximization By The Simplex Method (Exercises)
- 4.03: Minimization By The Simplex Method
- 4.3.01: Minimization By The Simplex Method (Exercises)
- 4.04: Chapter Review
- 05: Exponential and Logarithmic Functions
- 5.01: Prelude to Exponential and Logarithmic Functions
- 5.02: Exponential Growth and Decay Models
- 5.2.01: Exponential Growth and Decay Models (Exercises)
- 5.03: Graphs and Properties of Exponential Growth and Decay Functions
- 5.3.01: Graphs and Properties of Exponential Growth and Decay Functions (Exercises)
- 5.04: Logarithms and Logarithmic Functions
- 5.4.01: Logarithms and Logarithmic Functions (Exercises)
- 5.05: Graphs and Properties of Logarithmic Functions
- 5.5.01: Graphs and Properties of Logarithmic Functions (Exercises)
- 5.06: Application Problems with Exponential and Logarithmic Functions
- 5.6.01: Applications of Exponential and Logarithmic Functions (Exercises)
- 5.07: Chapter Review
- 06: Mathematics of Finance
- 6.01: Simple Interest and Discount
- 6.1.01: Simple Interest and Discount (Exercises)
- 6.02: Compound Interest
- 6.2.01: Compound Interest (Exercises)
- 6.03: Annuities and Sinking Funds
- 6.3.01: Annuities and Sinking Funds (Exercises)
- 6.04: Present Value of an Annuity and Installment Payment
- 6.4.01: Present Value of an Annuity and Installment Payment (Exercises)
- 6.05: Miscellaneous Application Problems
- 6.5.01: Miscellaneous Application Problems (Exercises)
- 6.06: Classification of Finance Problems
- 6.6.01: Classification of Finance Problems (Exercises)
- 6.07: Chapter Review
- 07: Sets and Counting
- 7.01: Sets and Counting
- 7.1.01: Sets and Counting (Exercises)
- 7.02: Tree Diagrams and the Multiplication Axiom
- 7.2.01: Tree Diagrams and the Multiplication Axiom (Exercises)
- 7.03: Permutations
- 7.3.01: Permutations (Exercises)
- 7.04: Circular Permutations and Permutations with Similar Elements
- 7.4.01: Circular Permutations and Permutations with Similar Elements (Exercises)
- 7.05: Combinations
- 7.5.01: Combinations (Exercises)
- 7.06: Combinations- Involving Several Sets
- 7.6.01: Combinations- Involving Several Sets (Exercises)
- 7.07: Binomial Theorem
- 7.7.01: Binomial Theorem (Exercises)
- 7.08: Chapter Review
- 08: Probability
- 8.01: Sample Spaces and Probability
- 8.1.01: Sample Spaces and Probability (Exercises)
- 8.02: Mutually Exclusive Events and the Addition Rule
- 8.2.01: Mutually Exclusive Events and the Addition Rule (Exercises)
- 8.03: Probability Using Tree Diagrams and Combinations
- 8.3.01: Probability Using Tree Diagrams and Combinations (Exercises)
- 8.04: Conditional Probability
- 8.4.01: Conditional Probability (Exercises)
- 8.05: Independent Events
- 8.5.01: Independent Events (Exercises)
- 8.06: Chapter Review
- 09: More Probability
- 9.01: Binomial Probability
- 9.1.01: Binomial Probability (Exercises)
- 9.02: Bayes' Formula
- 9.2.01: Bayes' Formula (Exercises)
- 9.03: Expected Value
- 9.3.01: Expected Value (Exercises)
- 9.04: Probability Using Tree Diagrams
- 9.4.01: Probability Using Tree Diagrams (Exercises)
- 9.05: Chapter Review
- 10: Markov Chains
- 10.01: Introduction to Markov Chains
- 10.1.01: Introduction to Markov Chains (Exercises)
- 10.02: Applications of Markov Chains
- 10.2.01: Applications of Markov Chains (Exercises)
- 10.03: Regular Markov Chains
- 10.3.01: Regular Markov Chains (Exercises)
- 10.04: Absorbing Markov Chains
- 10.4.01: Absorbing Markov Chains (Exercises)
- 10.05: CHAPTER REVIEW
- 11: Game Theory
- 11.01: Strictly Determined Games
- 11.1.01: Strictly Determined Games (Exercises)
- 11.02: Non-Strictly Determined Games
- 11.2.01: Non-Strictly Determined Games (Exercises)
- 11.03: Reduction by Dominance
- 11.3.01: Reduction by Dominance (Exercises)
- 11.04: Chapter Review