Positivity conjecture for the approximation exponents ftf_t

For integers t3t\geq 3, define

ft=infb>a10logminnNat+bt2ntlogbtat.f_t = \inf_{b>a \geq 10} \frac{\log \min_{n \in \mathbb{N}} \left| \frac{a^t+b^t}{2}-n^t \right|}{\log |b^t-a^t|}.

The numerical evidence suggests that f3=0f_3=0 and ft>0f_t>0 for t4t\geq 4. Positivity conjecture. For integers t4t\geq 4, ft>0f_t>0. On the other hand, f3=0f_3=0 and there are infinitely many integer solutions to

x3+y32z3{±1,±2}.x^3+y^3-2z^3 \in \{ \pm 1,\pm 2\}.

This conjecture is motivated by Mazur's near miss problem and concerns how closely perfect tt-th powers can approximate arithmetic progressions. The source provides numerical evidence but no proof of the asserted positivity for t4t\geq 4.

Sources & referencesView supporting material

Primary source

Jonathan M. Fraser and Han Yu, “Approximate arithmetic structure in large sets of integers”, arXiv:1905.05034 (2019).

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.