Compositions, Partitions, and Fibonacci Numbers
classification
🧮 math.CO
keywords
compositionsnumberpartitionspartsbijectivecommentaryequalsfibonacci
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.