No Detail Found!

New recurrence relation for partitions into distinct parts

Author(s)
Teerapat Srichan Department of Mathematics, Faculty of Science, Kasetsart University,Bangkok,Thailand
Abstract
Denote by Qn the set of partitions of a positive integer n into distinct parts. For k 2 N, denote by Qn;k the set of partitions of n into distinct parts whose least part is k + 1 and not equal to n. Let q(n) and q(n; k) be the number of elements in Qn and Qn;k, respectively. In this paper, several new recurrence relations for partitions into distinct parts are derived from the partition function q(n; k).
Publication Details
Page(s) 107-111
Published Journal: Discrete Mathematics Letters, Volume: 10, Issue: 0, Year: 2022

Request the full text from PASTIC

Keywords
restricted partition function, partition of integers, recursion formula
0

Citations

0

Downloads

24

Views