Course Title:
			
				Combinatorial Analysis
			
		 
		
			Course Description:
			
				Discusses some basic combinatorial concepts, with emphasis on enumerative combinatorics.  Topics may include inclusion-exclusion principle, binomial and multinomial coefficients, linear recurrences, ordinary and exponential generating functions, Stirling numbers, integer partitions, permutation groups and Polya’s theorem, Ramsey theorems, Marriage theorem, graphs and colorability, trees, Steiner systems, posets and polyhedra, and other topics at instructor’s discretion.
			
		 
		 
		
			Fall Offering:
			
				None
			
			Lab/Coreq 1:
			
				
			
		 
		
			Spring Offering:
			
				None
			
			Lab/Coreq 2:
			
				
			
		 
		
			Summer Offering:
			
				None
			
			Lab/Coreq Remarks:
			
				
			
		 
		
			Summer 1 Offering:
			
				None
			
			Prerequisite 1:
			
				MTH G101
			
		 
		
			Summer 2 Offering:
			
				None
			
			Prerequisite 2:
			
				MTH G111
			
		 
		
			Cross-Listed Course 1:
			
				
			
			Prerequisite 3:
			
				
			
		 
		
			Cross-Listed Course 2:
			
				
			
			Prerequisite 4:
			
				
			
		 
		
		
			Cross-Listed Course 3:
			
				
			
			Prerequisite 5:
			
				
			
		 
		
		
			Cross-Listed Course 4:
			
				
			
			Prerequisite Remarks:
			
				
			
		 
		
		
			Cross-Listed Course 5:
			
				
			
			Repeatable:
			
				N