The Carnegie Pulseabout the carnegie pulse | advertise | contact | subscriptions | join 
newsart & cultureopinionseventscourse schedule

My schedule
Most popular
View departments
View locations
View times

Find course by title:


21-301 Combinatorics

Department:Mathematical Sciences
Prerequisites:21-118 and 21-127
Related URLs:

A major part of the course concentrates on algebraic methods, which are relevant in the study of error correcting codes, and other areas. Topics covered in depth include permutations and combinations, generating functions, recurrence relations, the principle of inclusion and exclusion, and the Fibonacci sequence and the harmonic series. Additional topics may include existence proofs, partitions, finite calculus, generating combinatorial objects, Polya theory, codes, probabilistic methods. 3 hrs. lec

  Popularity index
Rank for this semester:#66
Rank in this department:#12

  Students also scheduled
15-213 Introduction to Computer Systems
15-390 Special Topic: Entrepreneurship for...
21-241 Matrix Algebra
15-212 Principles of Programming
21-257 Models and Methods for Optimization
82-135 Intensive Elementary Chinese
36-217 Probability Theory and Random Proce...
15-462 Computer Graphics
15-211 Fundamental Data Structures and Alg...
70-311 Organizational Behavior

  Spring 2005 times

Sec Time Day Instructor Location  
A 10:30 - 11:20 am M Bohman BH A53 Add course to my schedule
W Bohman BH A53
F Bohman BH A53

talkback to the pulse
No comments about this course have been posted, yet. Be the first to post!
Share your opinion on this course with other Pulse readers. Login below or register to begin posting.

Email address:

  (c) Copyright 2004 The Carnegie Pulse, Carnegie Mellon's first exclusively online student-run news source. campus mirror | RSS