Two-solutions conjecture for Type-I transcendental Diophantine equations
Statement
Let , , and be positive integers with , and let range over positive integers satisfying the Type-I transcendental Diophantine equation
Two-solutions conjecture. The equation has at most two solutions in positive integers; equivalently,
The conjecture is motivated by a computation over parameters up to , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.