Shevelev's parametrized twin-prime construction conjecture

About 17 years old · traced to

Let m≥4m\geq4, set Am={1,…,m−3}A_m=\{1,\ldots,m-3\}, and define

c~(m)(1)=m,\tilde{c}^{(m)}(1)=m,

with, for n≥2n\geq2,

c~(m)(n)=c~(m)(n−1)+{gcd⁡(n,c~(m)(n−1)),if n is even,gcd(n−2,c~(m)(n−1)),if n is odd.\tilde{c}^{(m)}(n)=\tilde{c}^{(m)}(n-1)+\begin{cases}\gcd(n,\tilde{c}^{(m)}(n-1)),&\text{if }n\text{ is even},\\gcd(n-2,\tilde{c}^{(m)}(n-1)),&\text{if }n\text{ is odd}.\end{cases}

Let n∗=n∗(m)n^*=n^*(m) be the point of the last nontrivial increment of {c~(m)(n)}\{\tilde{c}^{(m)}(n)\} on AmA_m, with n∗=1n^*=1 if there is no nontrivial increment on AmA_m. Shevelev's parametrized twin-prime construction conjecture. The numbers c~(m)(n∗)−n∗∓1\tilde{c}^{(m)}(n^*)-n^*\mp1 are twin primes. This proposed construction is intended to produce twin primes from each integer m≥4m\geq4; the supplied text gives no resolution.

References

Primary source

Vladimir Shevelev, “Theorems on twin primes-dual case”, arXiv:0912.4006 (2014).

Additional references

2 papers in this index state this conjecture (2009). The statement above is taken from the most recent of them; the others are arXiv:0911.5478.

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.