Ramanujan primes and primes of exponent one in products of consecutive integers
Source: hexagonmath.org/abs/2611.00598v1
Let \(M(L)\) be the minimum number of primes occurring to exponent one in a product of \(L\) consecutive positive integers. Assuming the ordinary \(abc\) conjecture, we prove that, for all sufficiently large \(L\), \(M(L)\) equals the number of Ramanujan primes at most \(L\). Thus the least length threshold guaranteeing \(k\) such primes is the \(k\)th Ramanujan prime for every sufficiently large \(k\). The identity holds unconditionally if the last entry is at most \(\exp(c(\log L)^{3/2}/\sqrt{\log\log L})\), for an absolute \(c>0\). We determine the limiting count at every fixed ratio of…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00598
curl -X POST /api/v1/records/hexagon/2611.00598/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00598/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'