ABSTRACT
It often occurs in enumerative combinatorics that obtaining an exact formula that answers a question is difficult, or time consuming, or even impossible, while it is much easier to obtain a formula that approximates the exact solution up to a specified level of precision. In this chapter, we consider examples of this phenomenon, and methods to apply in these situations. Unless otherwise noted, all power series in this chapter are assumed to have complex coefficients.
