ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a,b⩾2a,b\geqslant 2 be integers, and choose maximal positive integers kk and ℓ\ell such that a=Aka=A^k and b=Bℓb=B^\ell. Granville–Pappalardi's power-base conjecture. There are infinitely many primes of the form

∣am−bn∣|a^m-b^n|

with m,nm,n positive integers, unless there exists a non-zero integer QQ such that

(am−bn,Q)>1(a^m-b^n,Q)>1

for all positive integers m,nm,n satisfying (m,ℓ)=(n,k)=1(m,\ell)=(n,k)=1; in that case, there are only finitely many primes of the form ∣am−bn∣|a^m-b^n|. This extends the proposed prime-value statement to the case where one or both bases are perfect powers by restricting to exponents not covered by the forced factorization; the remaining assertion is conjectural.

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.