Skip to main contentSkip to footer
LER.me
  • Live Data
My LER
LER.me
My LER
LER.me

Make All Learning Count.

Get Connected

  • What is a LER?
  • FAQs (opens in new tab)
  • Partner with Us
  • Visit EBSCOed (opens in new tab)

View our Policies

  • Accessibility (opens in new tab)
  • Standards (opens in new tab)
  • Terms of Use (opens in new tab)
  • Privacy Policy (opens in new tab)
  • Opt out (opens in new tab)

Get the app

  • Get it on Google Play
  • Download on the App Store

© 2026 All rights reserved.

Powered by EBSCOed

Skip to main contentSkip to footer
LER.me
  • Live Data
My LER
LER.me
My LER
  1. Courses
  2. Combinatorial Enumeration

Combinatorial Enumeration

University of South Alabama

CourseMA 367

An introduction to the mathematical theory of counting. Topics covered are: basic counting principles, permutations, combinations, pigeonhole principle, inclusion-exclusion principle, partitions, recurrence relations, generating functions, and enumeration under group action.

Credits

3 credits

Course Code

MA 367

Related Courses

Prerequisites, corequisites, and courses that build on this one

Prerequisites

Complete these courses before enrolling

  • MA 126

    Calculus II

    4 credits
  • MA 267

    Discrete Math Structures

    3 credits
  • MA 320

    Foundations of Math - W

    3 credits

Required For

Courses that require this course as a prerequisite

  • MA 525

    Graph Theory

    3 credits
  • MA 521

    Enumerative Combinatorics

    3 credits
  • MA 425

    Graph Theory

    3 credits
Programs

Education programs that include this course

This course is not currently part of any programs.