Difference between revisions of "MAT2313"

From Department of Mathematics at UTSA
Jump to navigation Jump to search
(Changed content from Probability to combinatorics)
Line 1: Line 1:
−
Foundations of Mathematics (3-0) 3 Credit Hours  
+
= Combinatorics and Probability=
 +
3 Credit Hours  
 +
 
 
==Course Catalog==  
 
==Course Catalog==  
−
 
 
''Corequisite'': [[MAT1224]].  
 
''Corequisite'': [[MAT1224]].  
  
−
''Content'': Permutations, combinations, multinational coefficients, inclusion/exclusion principle, axioms of probability, conditional probability, Bayes formula, independent events, discrete random variables, expected value,m variance, discrete random variables (Bernoulli, Binomial, Poisson, geometric, hypergeometric and Zeta random variables), continuous random variables (uniform, normal and other distributions), joint distributions, properties of expectations, limit theorems (Chebyshev's inequality, Central Limit Theorem, Law of Large Numbers)) Generally offered: Fall, Spring, Summer.  
+
''Content'': Basic counting principles. Permutations and combinations. Binomial and multinomial coefficients. Pigeonhole and inclusion-exclusion principles. Graphs, colorings, planarity. Eulerian and Hamiltonian graphs. Recurrence relations. Generating functions. Prerequisites: MAT1224 Calculus II and MAT 1313 Algebra and Number Systems.
  
 
==Description==
 
==Description==
−
 
 
Introduction to the theory of probability, through the study of discrete and continuous random variables.
 
Introduction to the theory of probability, through the study of discrete and continuous random variables.
  
 
==Sample textbooks==
 
==Sample textbooks==
 +
Alan Tucker, Applied Combinatorics (6th ed). Wiley (2012).
 +
 +
==Topics List==
 +
Course outline:
 +
 +
Week 1: Finite sets, strings, enumeration, the addition and product rules.
 +
 +
Week 2: Combinations, permutations.
 +
 +
Week 3: Binomial and multinomial coefficients.
 +
 +
Week 4: The Pigeonhole Principle. The Inclusion-Exclusion Formula, derangements, the Euler ɸ function (totient).
 +
 +
Week 5: Review. First midterm exam.
  
−
* A ''Probability Course for the Actuaries: A Preparation for Exam P/1'', by Marcel B. Finan. Freely available [https://people.cas.uab.edu/~pjung/teaching_files/ProbabilityForActuaries.pdf online].
+
Week 6: Graphs and multigraphs.  
−
* Modern Mathematical Statistics with Applications (Springer Texts in Statistics). Jay L. Devore and Kenneth N. Berk. Second Edition.
 
  
−
==Topics List==
+
Week 7: Eulerian and Hamiltonian graphs.
−
{| class="wikitable sortable"
+
 
−
! Week !! Topic !! Sections from Finan's book !! Subtopics
+
Week 8: Trees. Colorings. Planarity.
−
|-
+
 
−
|  1-2 
+
Week 9: Review. First midterm exam.
−
|| [[Populations and Samples]]
+
 
−
|| Chapters 1-2
+
Week 10: Generating functions. The Binomial Theorem. Partitions.
−
||
 
−
* The Fundamental Principle of Counting
 
−
* Permutations and Combinations
 
−
* Permutations and Combinations with Indistinguishable Objects
 
−
|-
 
−
|  3-4 
 
−
|| [[Probability: Definitions and Properties]]
 
−
|| Chapter 3
 
−
||
 
−
* Basic Definitions and Axioms of Probability
 
−
* Properties of Probability
 
−
* Probability and Counting Techniques
 
−
|-
 
−
|  5 
 
−
|| [[Conditional Probability and Independence]]
 
−
|| Chapter 4
 
−
||
 
−
* Conditional Probabilities
 
−
* Posterior Probabilities: Bayes’ Formula
 
−
* Independent Events
 
−
* Odds and Conditional Probability
 
−
|-
 
−
|  6-8 
 
−
|| [[Discrete Random Variables]]
 
−
|| Chapter 5
 
−
||
 
−
* Random Variables
 
−
* Probability Mass Function and Cumulative Distribution Function119
 
−
* Expected Value of a Discrete Random Variable
 
−
* Expected Value of a Function of a Discrete Random Variable
 
−
* Variance and Standard Deviation
 
−
* Binomial and Multinomial Random Variables
 
−
* Poisson Random Variable
 
−
* Other Discrete Random Variables (Geometric, Hypergeometric, etc)
 
−
|-
 
−
|  9-10  
 
−
|| [[Continuous Random Variables]]
 
−
|| Chapter 6
 
−
||
 
−
* Distribution Functions
 
−
* Expectation, Variance and Standard Deviation
 
−
* The Uniform Distribution Function
 
−
* Normal Random Variables
 
−
* Exponential Random Variables
 
−
* Gamma and Beta Distributions
 
−
* The Distribution of a Function of a Random Variable
 
  
−
|-
+
Week 11: Recurrence relations. Linear recurrences.  
−
|  11  
 
−
|| [[Joint Distributions]]
 
−
|| Chapter 7
 
−
||
 
−
* Jointly Distributed Random Variables
 
−
* Independent Random Variables
 
−
* Sum of Two Independent Random Variables
 
−
|-
 
−
|  12 
 
−
|| [[Properties of Expectation]]
 
−
|| Chapter 8
 
−
||
 
−
* Expected Value of a Function of Two Random Variables . . . . . 351
 
−
* Covariance, Variance of Sums, and Correlations . . . . . . . . . 362
 
−
* Conditional Expectation . . . . . . . . . . . . . . . . . . . . . . 376
 
−
* Moment Generating Functions
 
−
|-
 
−
|  13-14 
 
−
|| [[Limit Theorems]]
 
−
|| Chapter 9
 
−
||
 
−
* The Law of Large Numbers
 
−
* The Central Limit Theorem
 
  
−
|}
+
Week 12: Solving recurrences by generating functions.
  
−
==See also==
+
Week 13: Exponential generating functions. Nonlinear recurrences.
  
−
* [https://catalog.utsa.edu/undergraduate/coursedescriptions/mat/ UTSA Undergraduate Mathematics Course Descriptions]
+
Week 15: Review.

Revision as of 21:41, 25 April 2023

Combinatorics and Probability

3 Credit Hours

Course Catalog

Corequisite: MAT1224.

Content: Basic counting principles. Permutations and combinations. Binomial and multinomial coefficients. Pigeonhole and inclusion-exclusion principles. Graphs, colorings, planarity. Eulerian and Hamiltonian graphs. Recurrence relations. Generating functions. Prerequisites: MAT1224 Calculus II and MAT 1313 Algebra and Number Systems.

Description

Introduction to the theory of probability, through the study of discrete and continuous random variables.

Sample textbooks

Alan Tucker, Applied Combinatorics (6th ed). Wiley (2012).

Topics List

Course outline:

Week 1: Finite sets, strings, enumeration, the addition and product rules.

Week 2: Combinations, permutations.

Week 3: Binomial and multinomial coefficients.

Week 4: The Pigeonhole Principle. The Inclusion-Exclusion Formula, derangements, the Euler ɸ function (totient).

Week 5: Review. First midterm exam.

Week 6: Graphs and multigraphs.

Week 7: Eulerian and Hamiltonian graphs.

Week 8: Trees. Colorings. Planarity.

Week 9: Review. First midterm exam.

Week 10: Generating functions. The Binomial Theorem. Partitions.

Week 11: Recurrence relations. Linear recurrences.

Week 12: Solving recurrences by generating functions.

Week 13: Exponential generating functions. Nonlinear recurrences.

Week 15: Review.

Retrieved from "https://mathresearch.utsa.edu/wiki/index.php?title=MAT2313&oldid=5214"