Binary number of remainders (including the final quotient of one) forms the binary value, as each remainder must be either zero or one when dividing by two. For example, (357) is expressed as (101100101) Conversion from base-2 to base-10 simply inverts the preceding algorithm. The bits of the binary number are used one by one, starting with the most significant (leftmost) bit. Beginning with the value 0, the prior value is doubled, and the next bit is then added to produce the next value. This can be organized in a multi-column table. For example, to convert 10010101101 to decimal: The result is
Combinatorial number system of a set "S" is a subset of "S" with "k" (distinct) elements. The main purpose of the combinatorial number system is to provide a representation, each by a single number, of all formula_1 possible "k"-combinations of a set "S" of "n" elements. Choosing, for any "n", } as such a set, it can be arranged that the representation of a given "k"-combination "C" is independent of the value of "n" (although "n" must of course be sufficiently large); in other words considering "C" as a subset of a larger set by increasing "n" will not change the number that