Proof of bijection for combinatorial number system

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.

arXiv commentCorrected the missing reference, wrong equation number and commented the dedication line

Cited by in corpus (2)

• Quantum algorithm for persistent Betti numbers and topological data analysis
• Review of a Quantum Algorithm for Betti Numbers