Least Realizers and Occupation in an Aligned Two-Block Collatz Family
The verification scripts, reference logs, and instructions for reproducing the computations are available in the companion GitHub repository This technical note asks whether a single positive integer can follow the six-step parity blocks 111100 and 111010 indefinitely under the Collatz shortcut map. Every finite sequence of these blocks is realized by infinitely many positive integers. The question is whether the least positive starting value must grow without bound as the number of blocks increases. The main theorem relates that least starting value to the number of admissible starts below a cutoff. Its proof uses a simple observation: a seed that survives long enough supplies several distinct later states, each of which must itself survive for the required number of blocks. A depth-averaging theorem shows that the proportion of candidate prefixes that survive tends to zero in natural density over the block depths. Two independent computations establish that the least positive integer completing 49 blocks is approximately \(1.65388\times10^{74}\). Exactly one positive integer below \(2^{241}\) completes 48 blocks, and it exits before completing block 49. The note also identifies a sufficient condition for universal exit from this family: for infinitely many positive integers \(m\), at most \(84m\) starting values below \(64^{5m}\) complete \(6m\) blocks. Proving this absolute count bound remains open.
Authors
- Elias De Jesus (ORCID: https://orcid.org/0009-0007-0190-9143)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-20
- DOI
- https://doi.org/10.5281/zenodo.24384827
- Primary Topic
- Analytic Number Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00