Binary number in hexadecimal) and then converting (formula_12 in hexadecimal) into (formula_12 in decimal). For very large numbers, these simple methods are inefficient because they perform a large number of multiplications or divisions where one operand is very large. A simple divide-and-conquer algorithm is more effective asymptotically: given a binary number, it is divided by 10, where "k" is chosen so that the quotient roughly equals the remainder; then each of these pieces is converted to decimal and the two are concatenated. Given a decimal number, it can be split into two pieces of about the same size, each of which 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