Equal prime divisors in disjoint blocks of consecutive integers
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 prove finiteness on fixed conics, on fixed equations in separated rational functions, and for pairs admitting two independent multiplicative relations. We also give exact counts in three strips of bounded separation, without a bound on either starting term. 37 pages. The modern ordered Erdős problem 931 remains open. AI disclosure: OpenAI's GPT-6.2 Astra carried out the mathematical research, developed the arguments and computations, and wrote this manuscript. Sunay Venkat, the author, takes full responsibility for its contents, including any errors.
Authors
- Sunay Venkat
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.5281/zenodo.24346975
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint