Document Type
Article
Publication Date
11-2011
Publication Title
Fibonacci Quarterly
ISSN
0015-0517
Abstract
A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n+ 1 into parts greater than one. Some commentary about the history of partitions and compositions is provided.
Recommended Citation
Sills, Andrew.
2011.
"Compositions, Partitions, and Fibonacci Numbers."
Fibonacci Quarterly, 49 (4): 348-354.
source: http://www.fq.math.ca/49-4.html
https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/178
Comments
This version of the paper was obtained from arXIV.org. In order for the work to be deposited in arXIV.org, the author must have permission to distribute the work or the work must be available under the Creative Commons Attribution license, Creative Commons Attribution-Noncommercial-ShareAlike license, or Create Commons Public Domain Declaration. The publisher's final edited version of this article is available at Fibonacci Quarterly.