Proof of bijection for combinatorial number system

2016/01/21 by Abu Bakar Siddique, Siddique, Abu Bakar, Saadia Farid +4
Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Theories #Combinatorics (math.CO) #FOS: Mathematics #Mathematics and Applications #math.CO

paper · pdf · doi:10.48550/arxiv.1601.05794

Corrected the missing reference, wrong equation number and commented the dedication line

arxiv created 2016/01/21 · openalex publication_date 2016/01/21 · arxiv updated 2016/01/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Combinatorial number system represents a non-negative natural numbers as sum of binomial coefficients. This paper presents an induction proof that there exists unique representation of every non-negative natural number m as sum of r binomial coefficients.

Related

• Two Combinatorial Theorems
• On proofs of certain combinatorial identities
• A combinatorial interpretation for the identity Sum_k=0ⁿ binomnk Sum_j=0^k binomkj³= Sum_k=0ⁿ binomnk²binom2kk
• New combinatorial interpretations of the binomial coefficients
• Elementary proof of congruences involving sum of binomial coefficients