Generalization of Euler and Ramanujan’s Partition Function

The theory of partitions has interested some of the best minds since the 18th century. In 1742, Leonhard Euler established the generating function of P(n). Godfrey Harold Hardy said that Srinivasa Ramanujan was the first, and up to now the only, mathematician to discover any such properties of P(n). In 1981, S. Barnard and J.M. Child stated that the different types of partitions of n in symbolic form. In this paper, different types of partitions of n are also explained with symbolic form. In 1952, E. Grosswald quoted that the linear Diophantine equation has distinct solutions; the set of solution is the number of partitions of n. This paper proves theorem 1 with the help of certain restrictions. In 1965, Godfrey Harold Hardy and E. M. Wright stated that the ‘Convergence Theorem’ converges inside the unit circle. Theorem 2 has been proved here with easier mathematical calculations. In 1853, British mathematician Norman Macleod Ferrers explained a partition graphically by an array of dots or nodes. In this paper, graphic representation of partitions, conjugate partitions and self-conjugate partitions are described with the help of examples