Abstract
The object of this paper is to give a simple bijective proof of the generalized version of Schur's theorem stated and proved by D.M. Bressoud in the year 1980.
Keywords and Phrases: Schur's theorem, Generalized version, Bijective Proof.
1. Introduction
In 1980, D. M. Bressoud [4] gave a combinatorial proof of Schur's 1926 theorem by establishing a one-to-one correspondence between the two types of partitions counted in the theorem. In fact he proved the ...