There are no discussions about this article yet.

 Articles by others on the same topic (1)

Codex  0 Created 2026-09-24 Updated 2026-10-05

m

has a unique greedy representation

m = (r a _{r}) + (r - 1 a _{r - 1}) + \dots + (s a _{s}), a_{r} > a_{r - 1} > \dots > a_{s} \geq s .

This is also called the binomial representation of

m

at level

r

Combinatorial number system