Sharp upper-bound conjecture for Fermat quotients

Let vpv_p denote the pp-adic valuation. The variables xx and qq are integers with x>1x>1, and pp and qq are primes in the second assertion. Sharp upper-bound conjecture for Fermat quotients. Except for finitely many pairs (x,p)(x,p), one has

vp(xp11)2+logx+2loglogx+loglogplogp.v_p(x^{p-1}-1)\leq 2+\frac{\log x+2\log\log x+\log\log p}{\log p}.

Furthermore, except for finitely many pairs (q,p)(q,p) of primes, one has

vp(qp11)2+logq+loglogq+loglogplogp.v_p(q^{p-1}-1)\leq 2+\frac{\log q+\log\log q+\log\log p}{\log p}.

The conjecture is presented as a sharper form of the preceding bounds; the source also notes a consequence under the abc conjecture, but does not establish these assertions.

Sources & referencesView supporting material

Primary source

Tomohiro Yamada, “A note on the paper by Bugeaud and Laurent "Minoration effective de la distance p-adique entre puissances de nombres algébriques"”, arXiv:math/0607072 (2007).

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.