Fermat–Catalan conjecture

As of 2015, the following ten solutions to equation (1) which meet the criteria of equation (2) are known:[1]

${\displaystyle 1^{m}+2^{3}=3^{2}\;}$ (for ${\displaystyle m>6}$ to satisfy Eq. 2)

${\displaystyle 2^{5}+7^{2}=3^{4}\;}$

${\displaystyle 7^{3}+13^{2}=2^{9}\;}$

${\displaystyle 2^{7}+17^{3}=71^{2}\;}$

${\displaystyle 3^{5}+11^{4}=122^{2}\;}$

${\displaystyle 33^{8}+1549034^{2}=15613^{3}\;}$

${\displaystyle 1414^{3}+2213459^{2}=65^{7}\;}$

${\displaystyle 9262^{3}+15312283^{2}=113^{7}\;}$

${\displaystyle 17^{7}+76271^{3}=21063928^{2}\;}$

${\displaystyle 43^{8}+96222^{3}=30042907^{2}\;}$

The first of these (1^m + 2³ = 3²) is the only solution where one of a, b or c is 1, according to the Catalan conjecture, proven in 2002 by Preda Mihăilescu. While this case leads to infinitely many solutions of (1) (since one can pick any m for m > 6), these solutions only give a single triplet of values (a^m, bⁿ, c^k).

It is known by the Darmon–Granville theorem, which uses Faltings's theorem, that for any fixed choice of positive integers m, n and k satisfying (2), only finitely many coprime triples (a, b, c) solving (1) exist.[2][3]^{: p. 64} However, the full Fermat–Catalan conjecture is stronger as it allows for the exponents m, n and k to vary.

The abc conjecture implies the Fermat–Catalan conjecture.[4]

For a list of results for impossible combinations of exponents, see Beal conjecture#Partial results. Beal's conjecture is true if and only if all Fermat–Catalan solutions have m = 2, n = 2, or k = 2.

• Sums of powers, a list of related conjectures and theorems

• Perfect Powers: Pillai's works and their developments. Waldschmidt, M.