A Probability Method to Prove Combinatorial Identities

2009/10/30 by Tong Zhu, Zhu, Tong
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Algorithms and Data Compression #Combinatorics (math.CO) #FOS: Mathematics

paper · pdf · doi:10.48550/arxiv.0910.5897

openalex publication_date 2009/10/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A probability method is provided to prove three classes of combinatorial identities. The method is extremely simple, only one step after the proper probability setup.

Related

• A View From The Bridge Spanning Combinatorics and Probability
• On finding a particular class of combinatorial identities
• Gamma function, Beta function and combinatorial identities
• Discrete mathematics: methods and challenges
• Combinatorics, Probability and Computing