Elsevier

Discrete Mathematics

Volume 287, Issues 1–3, 28 October 2004, Pages 125-128
Discrete Mathematics

Communication
A new bijective proof of a partition theorem of K. Alladi

https://doi.org/10.1016/j.disc.2004.07.006Get rights and content
Under an Elsevier user license
open archive

Abstract

The theorem “ the number of partitions of a positive integer n into distinct odd parts equals the number of partitions of n into parts 2 and differing by 6 with strict inequality if a part is even” was first discovered and then proved by Krishnaswamy Alladi in the year 1999. The object of this paper is to give a different bijective proof of this result.

MSC

primary 11P81, 11P83
secondary 05A19

Keywords

Partitions
Bijective proof
Alladi's theorem

Cited by (0)

The first author is partially and the last two authors are fully financially supported by Department of Science and Technology, New Delhi, India. Grant DST/MS/116/2K `Some Studies in Partition Theory'.