Difference between revisions of "MAT2313"

From Department of Mathematics at UTSA
Jump to navigation Jump to search
 
(11 intermediate revisions by 3 users not shown)
Line 1: Line 1:
−
Foundations of Mathematics (3-0) 3 Credit Hours
+
= Combinatorics and Probability - MAT2313=  
−
==Course Catalog==  
 
  
−
''Corequisite'': [[MAT1224]].
+
== Catalog entry ==
  
−
''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.  
+
''Prerequisite'': Algebra and Number Systems [[MAT1313]], or Discrete Mathematical Structures (CS 2233/2231), or instructor consent.
 +
''Corequisite'': [[MAT1224]]. (3-0) 3 Credit Hours.
  
−
==Description==
+
''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.  3 Credit Hours
  
−
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).
  
−
==Text==
+
==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. Second midterm exam.
  
−
* Modern Mathematical Statistics with Applications (Springer Texts in Statistics). Jay L. Devore and Kenneth N. Berk. Second Edition.
+
Week 10: Generating functions. The Binomial Theorem. Partitions.
  
−
==Topics List==
+
Week 11: Recurrence relations. Linear recurrences.  
−
{| class="wikitable sortable"
+
 
−
! Lecture !! Section !! Prerequisite Skills !! Student Learning Outcomes
+
Week 12: Solving recurrences by generating functions.
−
|-
 
−
|  1 
 
−
|| [[Populations and Samples]]
 
−
|| N/A
 
−
|| Understanding of the concepts of population and sample.
 
−
|-
 
−
|  2 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  3 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  4 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  5 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  6 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  7 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  8 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  9 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  10 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  11 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  12  
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  13 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  14 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  15 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  16 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  17 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  18 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  19 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  20 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  21 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  22 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  23 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  24 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  25 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  26 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  26 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  27 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  28 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  29
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  30 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  31 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  32 
 
−
||
 
−
||
 
−
||
 
−
|-
 
−
|  33 
 
−
||
 
−
||
 
−
||
 
−
|}
 
  
−
==See also==
+
Week 13: Exponential generating functions. Nonlinear recurrences.
  
−
* [https://catalog.utsa.edu/undergraduate/coursedescriptions/mat/ UTSA Undergraduate Mathematics Course Descriptions]
+
Week 15: Review.

Latest revision as of 15:52, 21 January 2025

Combinatorics and Probability - MAT2313

Catalog entry

Prerequisite: Algebra and Number Systems MAT1313, or Discrete Mathematical Structures (CS 2233/2231), or instructor consent. Corequisite: MAT1224. (3-0) 3 Credit Hours.

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. 3 Credit Hours

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. Second 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=5291"