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

My schedule
My textbooks
Most popular
View departments
View locations
View times

Find course by title:




 


21-301 Combinatorics

Units:9.0
Department:Mathematical Sciences
Prerequisites:21-122 and 21-127
Related URLs:http://www.math.cmu.edu

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:#51
Rank in this department:#11

  Students also scheduled
15-462 Computer Graphics
21-127 Concepts of Mathematics
15-123 Effective Programming in C and UNIX
15-211 Fundamental Data Structures and Alg...
21-111 Calculus I
21-120 Differential and Integral Calculus
09-101 Introduction to Experimental Chemis...
18-396 Signals and Systems
21-259 Calculus in Three Dimensions
15-100 Introductory/Intermediate Programmi...


The Carnegie Pulse: Pulse Scheduler: 21-301 Combinatorics
The Carnegie Pulseabout the carnegie pulse | advertise | contact | subscriptions | join 
newsart & cultureopinionseventsclassifiedscourse schedule

My schedule
My textbooks
Most popular
View departments
View locations
View times

Find course by title:




 


21-301 Combinatorics

Units:9.0
Department:Mathematical Sciences
Prerequisites:21-122 and 21-127
Related URLs:http://www.math.cmu.edu

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:#51
Rank in this department:#11

  Students also scheduled
15-462 Computer Graphics
21-127 Concepts of Mathematics
15-211 Fundamental Data Structures and Alg...
15-123 Effective Programming in C and UNIX
21-120 Differential and Integral Calculus
21-111 Calculus I
09-101 Introduction to Experimental Chemis...
18-396 Signals and Systems
21-259 Calculus in Three Dimensions
15-100 Introductory/Intermediate Programmi...


SecTimeDayInstructorLocation 
A3:30 - 4:20 pmM PikhurkoWEH 5403Add course to my schedule
W PikhurkoWEH 5403
F PikhurkoWEH 5403

 
  Course textbooks
* Spring 2007 textbooks given as estimate for Spring 2008 requirements

 Applied Combinatorics
Sections: A
S&H, taxes**Total 
Bookstore $111.00  $0.00  $111.00  
Bookstore (used) $83.25  $0.00  $83.25  
Amazon    $3.00  $3.00  
Amazon Marketplace*    $0.00  $0.00 
Powells $108.95 $0.00  $108.95  
Booksamillion $132.00 $0.00  $132.00  
eCampus $94.00 $0.00  $94.00  
eCampus (used)  $80.40 $0.00  $80.40  

Textbooks listed may be optional. Verify books with the course syllabus. * Items may be in new or used condition. Check site for details. ** Shipping, handling and taxes are estimated. Actual charges may vary.



 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:
Password:







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



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