Two combinatorial identities derived from the recurrence relation

DOI10.1080/0020739960270103zbMATH Open0882.05011OpenAlexW2088018427MaRDI QIDQ4360740FDOQ4360740

Authors: Diane M. Spresser, Jeffrey S. Fritz 

Publication date: 26 October 1997

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/0020739960270103

Recommendations

• Two combinatorial proofs of identities involving sums of powers of binomial coefficients
• Proof without words: alternating row sums in Pascal's triangle
• Proof without words: alternating row sums in Pascal's triangle
• scientific article; zbMATH DE number 2036174
• scientific article

zbMATH Keywords

recurrence relationinductioncombinatorial identitiesbinomial theoremPascal's triangle

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Two combinatorial identities derived from the recurrence relation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4360740)