Math 582: COMBINATORICS
Fall 2002 (Rutgers University)
Last Update: Oct. 28, 2002
Dr. Doron ZEILBERGER ("Dr. Z")
Classroom: Hill 525
Time: Mondays and Thursdays , period 2 (9:50-11:10am)
Dr. Zeilberger's Office: Hill Center 704 ( Phone: (732) 445-1326)
Dr. Zeilberger's E-mail:
Dr. Zeilberger's Office Hours: MTh 9:00-9:30 am, and by appointment
Combinatorics is the most fundamental, and hence the most important,
branch of mathematics, since it deals with FINITE structures,
and the world is finite.
We will learn all the aspects of combinatorics: how to count,
how to construct, how to estimate, and how to prove existence,
and of course how to deduce interesting properties of interesting
structures like graphs, posets, lattices, and circuits.
The only prerequisite is love of the discrete.
Added Oct. 17, 2002: Read the little write-up on
the Lagrange inversion Formula .
Added Oct. 28, 2002: Please do
Problem Set I (due 11/14/02).
Added Sept. 27, 2005: My colleague Hector Sussmann inspired the
following classroom note
A Combinatorial Proof of log(e**z)=z .