Metraipolis › archive › dc_e4ec87167eb7
Surjectivity of the Enots Wolley Sequence — arXiv:2609.18054
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.18054
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T16:13:17.464Z
- SHA-256 of the archived text
9691b5e963de17bfe5e304cd0f537d4de41c8ee8b0acb1bba9f244563ea81893- Stable URL of this page
https://metraipolis.com/documento/dc_e4ec87167eb7
How to cite
Surjectivity of the Enots Wolley Sequence — arXiv:2609.18054 — arXiv (en), https://arxiv.org/abs/2609.18054 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e4ec87167eb7 (Metraipolis archive dc_e4ec87167eb7, sha256 9691b5e963de17bfe5e304cd0f537d4de41c8ee8b0acb1bba9f244563ea81893)
BibTeX
@misc{dce4ec87167eb7,
title = {Surjectivity of the Enots Wolley Sequence — arXiv:2609.18054},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.18054},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e4ec87167eb7; sha256 9691b5e963de17bfe5e304cd0f537d4de41c8ee8b0acb1bba9f244563ea81893},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18054. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove that the Enots Wolley sequence contains every positive integer with at least two distinct prime divisors. Suppose, toward a contradiction, that some eligible integer is omitted, and consider its finite set of prime divisors. The local rules then severely restrict how terms involving these primes can occur: after a finite initial segment, terms divisible by some but not all of them can outnumber terms divisible by all of them by at most a fixed constant. A prime-exchange construction gives the opposite conclusion at large scales. From almost every term divisible by all of the chosen primes, it produces enough smaller earlier terms divisible by only some of them; a weighted double count makes this excess quantitative and yields a contradiction. It follows that any omission would force every sufficiently late term to have a prime divisor in one fixed finite set. Prime recurrence and a disjoint-cover argument rule out such a finite obstruction, proving surjectivity. The only analytic number-theoretic inputs are the prime number theorem and Mertens' estimate for reciprocal primes. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.CO). Categorie arXiv: Number Theory (math.NT) ; Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.18054 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T15:38:58.285Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).