Shevelev–Moses conjecture on merging prime-preserving sequences

Let HaH_a be the lexicographically first strictly increasing sequence beginning with Ha(2)=aH_a(2)=a such that Ha(n)H_a(n) is prime if and only if nn is prime. For primes a>b3a>b\geq 3, write HaH_a and HbH_b for the sequences with initial terms aa and bb, respectively. Shevelev–Moses conjecture. For arbitrary primes a>b3a>b\geq 3, the sequences HaH_a and HbH_b merge, meaning that they agree from some position onward. This conjecture concerns the interaction between lexicographically first prime-preserving sequences generated from different initial primes; the source provides no resolution, so the conjecture remains open.

Sources & referencesView supporting material

Primary source

Vladimir Shevelev and Peter J. C. Moses, “Constellations of primes generated by twin primes”, arXiv:1610.03385 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.