In 1995, R. Fokkink, W. Fokkink and Wang defined the in terms of , where is the smallest part of partition . In 2008, Andrews obtained the generating function for . In 2013, Andrews, Garvan and Liang extended the FFW-function and obtained the similar expressions for the spt-function and then defined the spt-crank generating functions. They also defined the generating function for in various ways. This paper shows how to find the number of partitions of n into distinct parts with certain conditions and shows how to prove the Theorem 1 by induction method. This paper shows how to prove the Theorem 2 with the help of two generating functions.
Cumulative Rating:
(not yet rated)
(no comments available yet for this resource)
Resource Comments