Fermat–Catalan conjecture#Known solutions

{{Short description|Generalization of Fermat's Last Theorem and of Catalan's conjecture,}}

{{Use dmy dates|date=March 2024}}

In number theory, the Fermat–Catalan conjecture is a generalization of Fermat's Last Theorem and of Catalan's conjecture. The conjecture states that the equation

{{NumBlk|::|a^m + b^n = c^k\quad|{{EquationRef|1}}}}

has only finitely many solutions (a, b, c, m, n, k) with distinct triplets of values (am, bn, ck) where a, b, c are positive coprime integers and m, n, k are positive integers satisfying

{{NumBlk|::|\frac{1}{m}+\frac{1}{n}+\frac{1}{k}<1.|{{EquationRef|2}}}}

The inequality on m, n, and k is a necessary part of the conjecture. Without the inequality there would be infinitely many solutions, for instance with k = 1 (for any a, b, m, and n and with c = am + bn), with m=n=k=2 (for the infinitely many Pythagorean triples), and e.g. 3^5 + 10^2 = 7^3.

Known solutions

As of 2015 the following ten solutions to equation (1) which meet the criteria of equation (2) are known:{{citation|first=Carl|last=Pomerance|authorlink=Carl Pomerance|contribution=Computational Number Theory|pages=361–362|title=The Princeton Companion to Mathematics|editor1-first=Timothy|editor1-last=Gowers|editor1-link=Timothy Gowers|editor2-first=June|editor2-last=Barrow-Green|editor3-first=Imre|editor3-last=Leader|editor3-link=Imre Leader|year=2008|publisher=Princeton University Press|isbn=978-0-691-11880-2}}.{{cite journal | doi=10.1215/S0012-7094-98-09105-0 | author=Frits Beukers | author-link=Frits Beukers |title=The Diophantine equation Axp+Byq=Czr | journal=Duke Math. J. | volume=91 | number=1 | pages=61–88 | date=Jan 1998 }} Here: p.61: "the larger [solutions] were found by a computer search performed on Fermat day at Utrecht in November 1993 ... Notice that in each solution an exponent 2 occurs."

:1^m+2^3=3^2\; (for m>6 to satisfy Eq. 2)

:2^5+7^2=3^4\;

:7^3+13^2=2^9\;

:2^7+17^3=71^2\;

:3^5+11^4=122^2\;

:33^8+1549034^2=15613^3\;

:1414^3+2213459^2=65^7\;

:9262^3+15312283^2=113^7\;

:17^7+76271^3=21063928^2\;

:43^8+96222^3=30042907^2\;

The first of these (1m + 23 = 32) 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 (am, bn, ck).

Partial results

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 (abc) solving (1) exist.{{cite journal |first1=H. |last1=Darmon |first2=A. |last2=Granville |title=On the equations zm = F(x, y) and Axp + Byq = Czr |journal=Bulletin of the London Mathematical Society |volume=27 |pages=513–43 |year=1995 |issue=6 |doi=10.1112/blms/27.6.513 |doi-access=free }}{{cite journal|last=Elkies| first = Noam D. | title=The ABC's of Number Theory | journal = The Harvard College Mathematics Review | year=2007 | volume=1 | issue = 1 | url=http://dash.harvard.edu/bitstream/handle/1/2793857/Elkies%20-%20ABCs%20of%20Number%20Theory.pdf?sequence=2}}{{rp|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.{{cite book

| last = Waldschmidt | first = Michel | authorlink = Michel Waldschmidt

| contribution = Lecture on the abc conjecture and some of its consequences

| doi = 10.1007/978-3-0348-0859-0_13

| mr = 3298238

| pages = 211–230

| publisher = Springer | location = Basel

| series = Springer Proc. Math. Stat.

| title = Mathematics in the 21st century

| url = http://www.imj-prg.fr/~michel.waldschmidt/articles/pdf/abcLahoreProceedings.pdf

| volume = 98

| year = 2015| isbn = 978-3-0348-0858-3 }}

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.

See also

References

{{reflist}}