ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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(xp−1−1)≤2+log⁡x+2log⁡log⁡x+log⁡log⁡plog⁡p.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(qp−1−1)≤2+log⁡q+log⁡log⁡q+log⁡log⁡plog⁡p.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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.