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 use
some vivid examples to demonstrate both the theoretical and applicable results of generating function.
2. Feller, W. (1965) An Introduction to Probability Theory And Its Applications. Volume II. John Wiley & Sons.
3. Riordan, J. (1958) An Introduction to Combinatorial Analysis. John Wiley & Sons. New York.
4. Tucker, A. (1980) Applied Combinatorics. John Wiley & Sons.
5. Crawley, M.J. (2007) The R Book. Imperial College London at Silwood Park, UK. John Wiley & Sons, Ltd.
Copyright (c) 2020 Journal of Progressive Research in Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
TRANSFER OF COPYRIGHT
JPRM is pleased to undertake the publication of your contribution to Journal of Progressive Research in Mathematics.
The copyright to this article is transferred to JPRM(including without limitation, the right to publish the work in whole or in part in any and all forms of media, now or hereafter known) effective if and when the article is accepted for publication thus granting JPRM all rights for the work so that both parties may be protected from the consequences of unauthorized use.