Proof of bijection for combinatorial number system
classification
🧮 math.CO
keywords
numberbinomialcoefficientscombinatorialnaturalnon-negativeproofsystem
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.