Pillai's conjecture
for any A, B, C, the equation Ax^m - By^n = C has finitely many solutions when m, n are not both 2.
Open the “Diophantine equations” section on Wikipedia →
Source: List of unsolved problems in mathematics (CC BY-SA 4.0)
All › Mathematics › Diophantine equations
for any A, B, C, the equation Ax^m - By^n = C has finitely many solutions when m, n are not both 2.
Open the “Diophantine equations” section on Wikipedia →
Source: List of unsolved problems in mathematics (CC BY-SA 4.0)