Linear programming over squarefree integers

The Mobius function provides a natural starting point since sum mu(k) floor(x/k) = 1 for all x (Mobius inversion). We formulated a cutting-plane LP over squarefree integers to optimize the score while respecting the Monte Carlo constraint. Cloud compute helped scale the LP to extended variable counts. The connection to Selberg-Erdos elementary proofs of PNT is beautiful — higher scores correspond to tighter bounds on prime distribution.