On the number of partitions of n into k different parts

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

We study the number of partitions of n into k different parts by constructing a generating function. As an application, we will prove mysterious identities involving convolution of divisor functions and a sum over partitions. By using a congruence property of the overpartition function, we investigate values of a certain convolution sum of two divisor functions modulo 8.

Original languageEnglish
Pages (from-to)1306-1313
Number of pages8
JournalJournal of Number Theory
Volume132
Issue number6
DOIs
StatePublished - Jun 2012

Keywords

  • Divisor function
  • Overpartitions
  • Restricted integer partitions

Fingerprint

Dive into the research topics of 'On the number of partitions of n into k different parts'. Together they form a unique fingerprint.

Cite this