Mixed radix
= Mixed radix
{title2=$n=\sum_i x_i\prod_{j<i}b_j$}
A positional representation in which each digit has its own positive <integer> base. Least-significant-first digits satisfy $0\leq x_i<b_i$, and digit $i$ has weight $\prod_{j<i}b_j$. For $k$ positions, assume $0\leq n<\prod_{i=0}^{k-1}b_i$. Repeated <Euclidean division> by the successive bases converts that <integer> to digits; a backwards version of <Horner's method> converts the digits back.