Maximum multiplicity

We start with the most irrational number, represented as a ratio of two integers. The ound off error is band limited, for each ratio going down.  We want the bandwidth of the M dimensional system to equalize.  But the next M+1 can treat the previous as a done deal, by virtue of the distributive property of directed flows. So one should be ale to count up the added rate until the next maximum point of multiplicity. My claim is that it must be recursive in the low energy and we know that solution. So the next dimension just counts up uthe unit count of the first, the queue size of the previous remained the same primes. We get humongous counts.

The system increases the precision, significant digits, of the error band, it can count much more though as the precision grows by prime factors. This is the error needed to carry the equally probable.