We investigate the density and distribution behaviors of the chinese remainder representation
pseudorank. We give a very strong approximation to density, and derive two efficient
algorithms to carry out an exact count (census) of the bad pseudorank integers. One of
these algorithms has been implemented, giving results in excellent agreement with
our density analysis out to 5189-bit integers.