math.NT — Number Theory
Balanced semiprimes in short intervals under the Riemann hypothesis
Assuming the Riemann hypothesis, we show that for every real x ≥ 9.6 × 10³⁷ the open interval of length 384√x (log x)² above x contains at least (14/3)√x distinct products of two primes of size comparable to √x. Their contribution to the sum of the least prime factor divided by the integer is at least 14/9. For every fixed C > 0, we also prove that the composite sum in an interval of length C√x (log x)² is bounded above unconditionally and bounded away from zero under the Riemann hypothesis. We present a computer-assisted proof, verified in Lean 4, that the mean-square estimate of Chirre and Hagen implies the explicit count and weight bounds. The results have not been independently reviewed.