We present the theory of analytic and symbolic combinatorics as presented by Flajolet and Sedgewick. Analytic combinatorics aims to study combinatorial problems through generating functions and complex analysis. The symbolic method is a manner of obtaining equations relating generating functions through set-theoretic combinatorial constructions. We use tools from both of these theories to present some particularly clean solutions to classical counting problems.