For each k, let P k be the product of the rst k primes. By the Chinese remainder theorem, each integer in the interval 0;P k) is determined by its residues modulo these k primes. We address the problems of space-eeciently computing the bits and the relative order of such numbers from their residues.
