ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let aa, bb, and cc be positive integers with a,c≥2a,c\geq2, and let (x,y)(x,y) range over positive integers satisfying the Type-I transcendental Diophantine equation

ax+b=cy.a^x+b=c^y.

Two-solutions conjecture. The equation has at most two solutions (x,y)(x,y) in positive integers; equivalently,

max⁡a,b,c∈N∗a,c≥2#{(x,y)∈N∗2∣ax+b=cy}=2.\max_{\substack{a,b,c\in\mathbb{N}^*\\a,c\geq2}}\#\{(x,y)\in\mathbb{N}^{*2}\mid a^x+b=c^y\}=2.

The conjecture is motivated by a computation over parameters up to 250250, where the largest observed number of solutions was two and ten equations attained that number. The computational evidence does not establish the asserted universal bound, which remains open.

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.