A new approach for proving or generating combinatorial identities
DOI10.1080/00207390903398382zbMATH Open1292.97051OpenAlexW2015185405WikidataQ99705208 ScholiaQ99705208MaRDI QIDQ3576740FDOQ3576740
Authors:
Publication date: 2 August 2010
Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207390903398382
Recommendations
combinatorial identitybinomial coefficientsPascal's trianglePascal's formularecursive combinatorial formula
Combinatorial identities, bijective combinatorics (05A19) Combinatorics (educational aspects) (97K20)
Cites Work
Cited In (12)
- Combinatorial identities with binomial coefficients
- A unified treatment of certain classes of combinatorial identities
- Title not available (Why is that?)
- Finite binomial sum identities with harmonic numbers
- Incomplete finite binomial sums of harmonic numbers
- A method for uniformly proving a family of identities
- A variation on the method of Cartier and Foata via covering systems for combinatorial identities
- A translation method for finding combinatorial bijections
- Some extensions of Chu's formulas and further combinatorial identities.
- Combinatorial identities involving harmonic numbers
- Polynomial interpolation and sums of powers of integers
- Combinatorial Identities for Stirling Numbers
This page was built for publication: A new approach for proving or generating combinatorial identities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576740)