ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let aa, bb, and cc be integers greater than one with gcd⁡(a,b)=1\gcd(a,b)=1, and consider solutions in positive integers (x,y,z)(x,y,z) to

ax+by=cz.a^x+b^y=c^z.

One-solution conjecture. There is at most one solution (x,y,z)(x,y,z), except when (a,b,c)(a,b,c) or (b,a,c)(b,a,c) is one of (5,2,3)(5,2,3), (7,2,3)(7,2,3), (3,2,11)(3,2,11), (3,2,35)(3,2,35), (3,2,259)(3,2,259), (3,4,259)(3,4,259), (3,16,259)(3,16,259), (5,2,133)(5,2,133), (3,10,13)(3,10,13), (89,2,91)(89,2,91), (91,2,8283)(91,2,8283), (3,5,2)(3,5,2), (3,13,2)(3,13,2), (3,13,4)(3,13,4), (3,13,16)(3,13,16), (3,13,2200)(3,13,2200), or (2n−1,2,2n+1)(2^n-1,2,2^n+1) for a positive integer n≥2n\geq 2. The conjecture proposes a complete list of triples for which more than one positive-integer solution can occur. The stated result is presented as a conjecture in the paper, and no resolution is supplied in the given context.

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.