Proof of bijection for combinatorial number system
From MaRDI portal
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 as sum of binomial coefficients.
This page was built for publication: Proof of bijection for combinatorial number system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6269554)