Analytic Combinatorics
Princeton University · View on Coursera ↗
Taught by Robert Sedgewick
Math and Logic
About the course
Analytic Combinatorics teaches a calculus that enables precise quantitative predictions of large combinatorial structures. This course introduces the symbolic method to derive functional relations among ordinary, exponential, and multivariate generating functions, and methods in complex analysis for deriving accurate asymptotics from the GF equations. All the features of this course are available for free. People who are interested in digging deeper into the content may wish to obtain the textb
The consensus
Every one of the 20 reviews we read gave it 4★ or more. This is the most-upvoted one (6 votes).
“This is my first course on Coursera. I've found it among set of Ivy League free courses, advertised on the Internet due to Coronavirus. The topic is very interesting - on standard discrete mathematic courses on mathematical or IT studies, generating functions are treated very softly. Here I could learn many great things. Second part of course may be a little bit harder for IT students who do not have previous knowledge about complex analysis.”
Coursera's 4.6 comes from 76 ratings. Of those, 6.6% are 1–2★.
Starisk reads the reviews learners voted most helpful, and weights each by the square root of its votes: a review with 80 upvotes counts about five times one with 2. Unvoted reviews are not skipped out of laziness — by this model they carry no evidence that other students endorsed them.
That measures what the most-endorsed reviews say, not “true quality.” The rating distribution above is the whole population, so you can see the sample next to it.
Reviews read on 23 Oct 2026.Read them on Coursera ↗