| 10/21/2025 12:12:42 PM |
| Changed Course |
| CATALOG INFORMATION
|
| Discipline and Nbr:
MATH 9 | Title:
FINITE MATH |
|
| Full Title:
Finite Mathematics |
| Last Reviewed:10/20/2025 |
| Units | Course Hours per Week | | Nbr of Weeks | Course Hours Total |
| Maximum | 4.00 | Lecture Scheduled | 4.00 | 17.5 max. | Lecture Scheduled | 70.00 |
| Minimum | 4.00 | Lab Scheduled | 0 | 6.5 min. | Lab Scheduled | 0 |
| | Contact DHR | 0 | | Contact DHR | 0 |
| | Contact Total | 4.00 | | Contact Total | 70.00 |
| |
| | Non-contact DHR | 0 | | Non-contact DHR Total | 0 |
| | Total Out of Class Hours: 140.00 | Total Student Learning Hours: 210.00 | |
Title 5 Category:
AA Degree Applicable
Grading:
Grade or P/NP
Repeatability:
00 - Two Repeats if Grade was D, F, NC, or NP
Also Listed As:
Formerly:
Catalog Description:
Untitled document
Students will study sets, matrices, systems of equations and inequalities, linear programming, combinatorial techniques and probability, mathematics of finance, Markov chains, and game theory.
Prerequisites/Corequisites:
Placement as determined by the college’s multiple measures assessment process or completion of a course taught at or above the level of intermediate algebra. Math Tier 1 or higher
Recommended Preparation:
Limits on Enrollment:
Schedule of Classes Information
Description:
Untitled document
Students will study sets, matrices, systems of equations and inequalities, linear programming, combinatorial techniques and probability, mathematics of finance, Markov chains, and game theory.
(Grade or P/NP)
Prerequisites:Placement as determined by the college’s multiple measures assessment process or completion of a course taught at or above the level of intermediate algebra. Math Tier 1 or higher
Recommended:
Limits on Enrollment:
Transfer Credit:CSU;UC.
Repeatability:00 - Two Repeats if Grade was D, F, NC, or NP
ARTICULATION, MAJOR, and CERTIFICATION INFORMATION
| Associate Degree: | Effective: | Fall 2025
| Inactive: | |
| Area: | B
L2
MC
| Communication and Analytical Thinking
Mathematical Concepts & Quantitative Reasoning
Math Competency
|
| |
| CSU GE: | Transfer Area | | Effective: | Inactive: |
| | B4 | Math/Quantitative Reasoning | Fall 1981 | |
| |
| IGETC: | Transfer Area | | Effective: | Inactive: |
| | 2A | Mathematical Concepts & Quantitative Reasoning | Fall 1981 | |
| |
| CSU Transfer: | Transferable | Effective: | Fall 1981 | Inactive: | |
| |
| UC Transfer: | Transferable | Effective: | Fall 1981 | Inactive: | |
| |
| C-ID: |
| CID Descriptor: MATH 130 | Finite Mathematics | SRJC Equivalent Course(s): MATH9 |
Certificate/Major Applicable:
Major Applicable Course
COURSE CONTENT
Student Learning Outcomes:
At the conclusion of this course, the student should be able to:
Untitled document
1. Solve linear programming problems using graphing and simplex methods.
2. Apply the formulae of the mathematics of finance to real-world situations.
3. Use basic set theory, combinatorial techniques, probability, expected value, Markov chains, and game theory.
Objectives:
Untitled document
At the conclusion of this course, the student should be able to:
1. Apply linear and exponential functions to solve problems in finance economics.
2. Write a system of linear equations to solve applied problems.
3. Solve a system of linear equations using Gauss-Jordan elimination and interpret the result.
4. Find the inverse of a square matrix using technology and use the inverse to solve a system of linear equations.
5. Use Leontief input-output method to determine required industrial output.
6. Solve linear programming problems in at least three variables.
7. Apply graphical and simplex methods to linear programming problems.
8. Find unions, intersections and complements of sets using Venn diagrams.
9. Apply the fundamental counting principle, permutations, and combinations to probability problems.
10. Determine the probability of a specified event.
11. Use expected value, conditional probability, and Markov chains.
12. Solve applied problems in finance including simple and compound interest.
13. Solve applied problems in finance including future and present value, annuities, sinking funds, and amortization.
14. Apply fundamentals of game theory.
Topics and Scope
Untitled document
I. Discrete Methods
A. Set Theory including DeMorgan's laws and Venn diagrams
B. Matrices
1. Matrix algebra, including inverses to solve systems of linear equations in at least three variables
2. Using Gauss-Jordan elimination and reduced row echelon form and applications
3. Using technology to find matrix inverses
4. Leontief input-output analysis
C. Counting techniques
1. Fundamental counting principle
2. Permutations
3. Combinations
II. Probability
A. Finding the probability of an event given the probabilities of the simple events in a sample space
B. Finding probabilities using combinatorics including permutations and combinations
C. Expected value
D. Conditional probability
III. Markov Chains
A. Regular Markov chains
B. Absorbing Markov chains
C. Applications of Markov chains
IV. Linear Programming
A. Graphical methods
B. Simplex method in at least three variables
C. Dual simplex method
D. Simplex method with mixed constraints
E. Use of technology to solve linear programming problems
V. Mathematics of Finance and Economics
A. Simple and compound interest problems
B. Annuities
C. Present value
D. Future value
E. Sinking funds
G. Loans using amortization
VI. Game Theory
A. Fundamentals
B. Strictly determined games
C. Mixed-strategy games
D. Using simplex method to solve mixed-strategy games
Assignments:
Untitled document
1. Reading assignments (10-50 pages per week)
2. Problem set assignment(s) from required text(s), or supplementary materials chosen by the instructor (1-6 per week)
3. Quiz(zes) (0-4 per week)
4. Exams (2-8 per term)
5. Final Exam
6. Project(s) (computer explorations or modeling activities, 0-10 per term)
Methods of Evaluation/Basis of Grade.
| Writing: Assessment tools that demonstrate writing skill and/or require students to select, organize and explain ideas in writing. | Writing
0 - 0% |
| None | |
| This is a degree applicable course but assessment tools based on writing are not included because problem solving assessments are more appropriate for this course. |
|
| Problem solving: Assessment tools, other than exams, that demonstrate competence in computational or non-computational problem solving skills. | Problem Solving
10 - 20% |
| Problem set assignment(s) | |
| Skill Demonstrations: All skill-based and physical demonstrations used for assessment purposes including skill performance exams. | Skill Demonstrations
0 - 0% |
| None | |
| Exams: All forms of formal testing, other than skill performance exams. | Exams
70 - 90% |
| Quiz(zes), exams, final exam | |
| Other: Includes any assessment tools that do not logically fit into the above categories. | Other Category
0 - 10% |
| Project(s) | |
Representative Textbooks and Materials:
Untitled document
Finite Mathematics for Business, Economics, Life Science, and Social Sciences. 13th ed. Barnett, Raymond, Ziegler, Michael and Byleen, Karl. Pearson. 2015. (classic).
Finite Mathematics. 12th ed. Lial, Margaret and Greenwell, Raymond and Ritchey, Nathan. Pearson. 2021.
Finite Mathematics. 6th ed. Waner, Stefan and Constenoble, Steven. Cengage Learning. 2014. (classic).
Applied Finite Mathematics. Sekhon, Rupinear. OpenStax CNX, 2011. (clasisic).
Print PDF