Math-1518 · mathematics · Graph theory

Math-1518

Conjecture 1.3 — Pillai

Status Partially solved · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedPartially solvedOpen

Statement

Definitions and mathematical statement

A perfect power here means an integer $u^r$ with integers $u\ge2$ and $r\ge2$. Let $k\ge1$ be fixed, and form the set \[ \mathcal S_k=\{(x,y,p,q)\in\mathbb Z_{\ge2}^4:x^p-y^q=k\}. \] Pillai's conjecture asks whether $\mathcal S_k$ is finite for every choice of the positive integer $k$. All four coordinates are allowed to vary. In particular, neither exponent is fixed in advance, and $x$ and $y$ need not be coprime or themselves free of perfect-power representations.

The quantifiers are $\forall k\ge1$, followed by finiteness of its entire solution set. No bound uniform in $k$, effective algorithm to list the solutions, or explicit formula for the bound is required by this formulation. Distinct exponent representations are counted as distinct quadruples, though a fixed positive integer has only finitely many representations with base and exponent at least two.

Equivalently, list the distinct perfect powers increasingly as $a_1<a_2<\cdots$. The conjecture says $a_{j+1}-a_j\to\infty$ as $j\to\infty$. Indeed, bounded gaps infinitely often would repeat one positive difference; conversely, infinitely many pairs at one fixed distance would force bounded consecutive gaps infinitely often. Thus the target excludes an endlessly recurring fixed positive separation between two perfect powers, regardless of which exponents produce them.

Short English statement

For every fixed positive gap, are there only finitely many pairs of perfect powers separated by that gap?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.