The number theorist wants to construct a sequence of special linear group matrices of dimension M, M getting larger. Find the points where M has run its mas and M+1 takes out another moment in the set M+1 binomials.
Construct a path from M=3, at maximum to M going up. If you can infer a slot in that path then you know more about primes. The problem translates into a problem of the uncertainty in N, total count of error correction. And as the dimensionality increased, we would expect powers of that uncertainty, and get another iLog(i) relationship if M, dimensionality, increasing, proving the prime number theory once again.
Finite aggregate systems approximate logarithm with fraction to stay stable. Maintain a smooth manifold. Better named the theory of relative primes deciding the maximum proper set of relative primes for any M dimensional aggregate system.
No comments:
Post a Comment