Proof of bijection for combinatorial number system

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.

No reviews yet.

No comments yet.