A deterministic model of where the prime numbers fall, derived not from probabilistic heuristics but from comparing two multiplicative statistics on integer partitions (the norm and the supernorm). The n-th prime is expressed through a running sum of the divisor function plus an explicit, asymptotically negligible error term, giving prime-counting estimates that beat the logarithmic integral at small scales while reproducing the prime number theorem and suggesting the twin prime conjecture. Studying it shows how combinatorial partition ideas can constrain the multiplicative structure of the integers.
This number-theory paper builds a deterministic model of the prime numbers out of ideas from the theory of integer partitions, rather than from the usual probabilistic random-model heuristics. Compar…