This Chinese remainder issue

The remainders is round off error, the remainder theorem equivalent to stepping under a Plank variation in n dimensions. Solving the theorem should look a lot like bouncing through an n-tuple Markov tree. And the equivalent polynomial and algebraic proofs should line up. That may be true, but I am old and tired.

For system composed of n primes at maximum entropy we can work with the round off errors, which becomes a small graph. For any n we get an equivalent of light, uncertainty, and sample rate, and a Markov tree for that n. We can prove something unproveable by the expansion of those trees  all by moving about the set of trees.