Home Partition of an Integer into Distinct Bounded Parts, Identities and Bounds
Article
Licensed
Unlicensed Requires Authentication

Partition of an Integer into Distinct Bounded Parts, Identities and Bounds

  • Mohammadreza Bidar EMAIL logo
Published/Copyright: May 31, 2012
Become an author with De Gruyter Brill
Integers
From the journal Volume 12 Issue 3

Abstract.

The partition function , which denotes the number of partitions of a positive integer n into distinct parts, has been the subject of a dozen papers. In this paper, we study this kind of partition with the additional constraint that the parts are bounded by a fixed integer. We denote the number of partitions of an integer n into distinct parts, each , by . We find a sharp upper bound for , and more, an infinite series lower bound for the partition function . In the last section, we exhibit a group of interesting identities involving that arise from a combinatorial problem.

Received: 2011-03-15
Accepted: 2012-01-10
Published Online: 2012-05-31
Published in Print: 2012-June

© 2012 by Walter de Gruyter Berlin Boston

Downloaded on 7.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/integers-2011-0115/html
Scroll to top button