A prime number "Game of Life": can floor($y \cdot p\#$) be prime for all $p$>=2?
Martin Raab
TL;DR
The paper investigates whether a floor transformation of the primorial, $\lfloor y\cdot p\#\rfloor$, can be prime for all primes $p\ge2$ by constructing a slowly growing, Mills-like prime-generation family $\{q\}$ tied to $p\#$ via a fixed $y$. It develops a probabilistic, stage-by-stage framework linking prime distribution in primorial-sized intervals to Chebyshev bias, $\theta(p)$, and (conditionally) RH, introducing quantities like $\omega(s)$ and $\psi(p)$ to predict survival and growth. Computational results up to stage 331 show high survival probabilities for multiple branches and reveal an extremely narrow admissible $y$-range suggesting a near-unique infinite run, while Appendix material analyzes variations, descendants, and real-world feasibility of the construction. The work broadens the landscape of prime-generating sequences, connects to classical prime-bias results, and raises open questions about the existence and uniqueness of a universal $y$ yielding infinite primes, as well as potential semi-sequences and broader applications.
Abstract
A new sequence in the spirit of the Mills primes is presented and its properties are investigated.
