Article overview
Abstract
In this paper we provide a bijective proof for the theorem 3.1 of Andrews [6]. This theorem involves the number of semi-Fibonacci partitions and the number of binary partitions in which each part appears an odd number of times.
Keywords and Phrases
Integer PartitionsSemi-FibonacciBinary PartitionsBijective ProofPartition Identities.
AMS Subject Classification
05A17, 11P82, 11P84.
Reference information
How to Cite
Mateus Alegri (2020). A NOTE ON A BIJECTIVE PROOF OF A THEOREM OF G. E. ANDREWS. Journal of Ramanujan Society of Mathematics and Mathematical Sciences, 8(1), 01-06.