Quantitative refinement of Pillai's conjecture

About 17 years old · traced to

Let ε>0\varepsilon>0, and let a,b,x,ya,b,x,y be positive integers with x,y≥2x,y\ge 2 and ax≠bya^x\ne b^y. Quantitative Pillai conjecture. There exists a constant κ(ε)>0\kappa(\varepsilon)>0 such that

∣ax−by∣≥κ(ε)max⁡ax,by1−(1/x)−(1/y)−ε.|a^x-b^y|\ge \kappa(\varepsilon)\max\\{a^x,b^y\\}^{1-(1/x)-(1/y)-\varepsilon}.

This would give an effective lower bound for the distance between distinct perfect powers. It is presented as a conjectural quantitative strengthening of Pillai's conjecture and remains open.

References

Primary source

Michel Waldschmidt, “Perfect Powers: Pillai's works and their developments”, arXiv:0908.4031 (2009).

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.