ON FINDING COEFFICIENT OF GENERATING FUNCTION

This paper review the method of determining the coefficients of a generating function. Generating functions are a convenient tool for handling special constraints in selection and arrangement problems. It can be used in recurrence relations, inclusion exclusion events study, and polya’s enumeration formula. It may also help to solve some other combinatorial problems. Generating functions are a kind of abstract problem-solving technique once we understand it may easy to model a broad spectrum of combinatorial problems. In this paper, we will usesome vivid examples to demonstrate both the theoretical and applicable results of generating function