Equal prime divisors in disjoint blocks of consecutive integers
Source: hexagonmath.org/abs/2611.00599v1
We construct infinitely many disjoint pairs of consecutive blocks, of lengths three and four in that order, whose products have identical prime divisors. Their starting positions disprove the finiteness and separation predictions in Erdős’s 1976 formulation. The modern Erdős problem 931 requires the earlier block to be at least as long as the later one and remains open. For any fixed lengths \(k,\ell\ge2\), the number of equal-support pairs with increasing first terms at most \(X\), even allowing overlap, is \(O_{k,\ell,\varepsilon}(X^{2/3+\varepsilon})\). In the modern length order, we…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00599
curl -X POST /api/v1/records/hexagon/2611.00599/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00599/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'