A review of enumeration methods on integer partition

  • Samuel Asefa Fufa Addis Ababa University
  • Fikre Bogale Petros Addis Ababa University
Keywords: Integer partitions; Partition identity; Partitions into parts of different sizes; Ferrer’s diagram; Generating function

Abstract

A partition of a non-negative integer  is a way of writing  as a sum of a non-decreasing sequence of parts. The paper provides the study of some properties of integer partitions. In particular, we are interested to show the number of partitions of  in which the summand  appears at most  times is equal to the number of  partitions in which  the part  appears any times and the other part  appears at most  times by using a generating function and algebraic construction.

Author Biographies

Samuel Asefa Fufa , Addis Ababa University

Department of Mathematics

Fikre Bogale Petros, Addis Ababa University

Department of Mathematics

Published
2020-06-07
Section
Review articles

Journal Identifiers


eISSN: 2520-7997
print ISSN: 0379-2897