Frantzikinakis's prime progressions with fractional-power differences conjecture

About 2 years old · traced to

Let k∈Nk\in\mathbb{N} and let cc be a positive real number. Write P\mathbb{P} for the set of primes. Frantzikinakis's conjecture. For infinitely many pairs (p,m)∈P×N(p,m)\in\mathbb{P}\times\mathbb{N},

{p,p+⌊mc⌋,p+2⌊mc⌋,…,p+k⌊mc⌋}⊆P.\{p,p+\lfloor m^c\rfloor,p+2\lfloor m^c\rfloor,\ldots,p+k\lfloor m^c\rfloor\}\subseteq\mathbb{P}.

Moreover, for any positive real numbers c1,…,ckc_1,\ldots,c_k, there are infinitely many pairs (p,m)∈P×N(p,m)\in\mathbb{P}\times\mathbb{N} such that

{p,p+⌊mc1⌋,p+⌊mc2⌋,…,p+⌊mck⌋}⊆P.\{p,p+\lfloor m^{c_1}\rfloor,p+\lfloor m^{c_2}\rfloor,\ldots,p+\lfloor m^{c_k}\rfloor\}\subseteq\mathbb{P}.

The source presents this as a problem posed by Frantzikinakis, generalizing an earlier result in two directions: arithmetic progressions whose common difference is a fractional-power value, and configurations involving several fractional powers. It remains open.

References

Primary source

Bora Çalım, Ioannis Iakovakis, Sophie Long, Jack Moffatt and Deborah Wooton, “Popular differences in primes along fractional powers”, arXiv:2411.17599 (2024).

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.