Granville–Pappalardi conjecture for prime values with power bases

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

ambn|a^m-b^n|

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

(ambn,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 ambn|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.

Sources & referencesView supporting material

Primary source

Andrew Granville and Francesco Pappalardi, “Two dimensional covering systems and possible prime producing a^m-b^n”, arXiv:2601.10296 (2026).

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.