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.
| Original language | English |
|---|---|
| Pages (from-to) | 348-354 |
| Number of pages | 7 |
| Journal | Fibonacci Quarterly |
| Volume | 49 |
| Issue number | 4 |
| State | Published - Nov 2011 |
Scopus Subject Areas
- Algebra and Number Theory
Fingerprint
Dive into the research topics of 'Compositions, partitions, and fibonacci numbers'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver