Catalan's conjecture (or Mihăilescu's theorem) is a theorem in number theory that was conjectured by the mathematician Eugène Charles Catalan in 1844 and proven in 2002 by Preda Mihăilescu at Paderborn University. The integers 23 and 32 are two perfect powers (that is, powers of exponent higher than one) of natural numbers whose values (8 and 9, respectively) are consecutive. The theorem states that this is the only case of two consecutive perfect powers. That is to say, that

Catalan's conjecture—the only solution in the natural numbers of

x a − y b = 1 {\displaystyle x^{a}-y^{b}=1}

for a, b > 1, x, y > 0 is x = 3, a = 2, y = 2, b = 3.

History

The history of the problem dates back at least to Gersonides, who proved a special case of the conjecture in 1343 where (x, y) was restricted to be (2, 3) or (3, 2). The first significant progress after Catalan made his conjecture came in 1850 when Victor-Amédée Lebesgue dealt with the case b = 2.

In 1976, Robert Tijdeman applied Baker's method in transcendence theory to establish a bound on a,b and used existing results bounding x,y in terms of a, b to give an effective upper bound for x,y,a,b. Michel Langevin computed a value of exp ⁡ exp ⁡ exp ⁡ exp ⁡ 730 ≈ 10 10 10 10 317 {\displaystyle \exp \exp \exp \exp 730\approx 10^{10^{10^{10^{317}}}}} for the bound, resolving Catalan's conjecture for all but a finite number of cases.

Catalan's conjecture was proven by Preda Mihăilescu in April 2002. The proof was published in the Journal für die reine und angewandte Mathematik, 2004. It makes extensive use of the theory of cyclotomic fields and Galois modules. An exposition of the proof was given by Yuri Bilu in the Séminaire Bourbaki. In 2005, Mihăilescu published a simplified proof.

Pillai's conjecture

Pillai's conjecture concerns a general difference of perfect powers (sequence A001597 in the OEIS): it is an open problem initially proposed by S. S. Pillai, who conjectured that the gaps in the sequence of perfect powers tend to infinity. This is equivalent to saying that each positive integer occurs only finitely many times as a difference of perfect powers: more generally, in 1931 Pillai conjectured that for fixed positive integers A, B, C the equation A x n − B y m = C {\displaystyle Ax^{n}-By^{m}=C} has only finitely many solutions (x, y, m, n) with (m, n) ≠ (2, 2). Pillai proved that for fixed A, B, x, y, and for any λ less than 1, we have | A x n − B y m | ≫ x λ n {\displaystyle |Ax^{n}-By^{m}|\gg x^{\lambda n}} uniformly in m and n.

The general conjecture would follow from the ABC conjecture.

Pillai's conjecture means that for every natural number n, there are only finitely many pairs of perfect powers with difference n. The list below shows, for n ≤ 64, all solutions for perfect powers less than 1018, such that the exponent of both powers is greater than 1. The number of such solutions for each n is listed at (sequence A076427 in the OEIS). See also (sequence A103953 in the OEIS) for the smallest solution (> 0).

nsolution countnumbers k such that k and k + n are both perfect powersnsolution countnumbers k such that k and k + n are both perfect powers
11833216, 256
2125340none
321, 1253531, 289, 1296
434, 32, 12136264, 1728
524, 2737327, 324, 14348907
60none3811331
751, 9, 25, 121, 3276139425, 361, 961, 10609
831, 8, 973364049, 81, 216, 2704
9416, 27, 216, 640004138, 128, 400
1012187420none
11416, 25, 3125, 3364431441
1224, 219744381, 100, 125
13336, 243, 49004544, 36, 484, 9216
140none461243
1531, 49, 129502947681, 169, 196, 529, 1681, 250000
1639, 16, 1284841, 16, 121, 21904
1778, 32, 64, 512, 79507, 140608, 14338415290449332, 576, 274576
1839, 225, 343500none
1958, 81, 125, 324, 50328435651249, 625
20216, 196521144
2124, 100532676, 24336
22227, 218754227, 289
2344, 9, 121, 20255539, 729, 175561
2451, 8, 25, 1000, 5429390803125648, 25, 169, 5776
252100, 14457364, 343, 784
2631, 42849, 6436343580none
2739, 169, 216591841
2874, 8, 36, 100, 484, 50625, 1310446044, 196, 2515396, 2535525316
29119661264, 900
3016859620none
3121, 2256341, 81, 961, 183250369
3244, 32, 49, 774464436, 64, 225, 512

See also

Notes

  • Bilu, Yuri (2004), "Catalan's conjecture (after Mihăilescu)", Astérisque, 294: vii, 1–26, MR
  • Catalan, Eugene (1844), , J. Reine Angew. Math. (in French), 27: 192, doi:, MR
  • Cohen, Henri (2005). Démonstration de la conjecture de Catalan [A proof of the Catalan conjecture]. Théorie algorithmique des nombres et équations diophantiennes (in French). Palaiseau: Éditions de l'École Polytechnique. pp. 1–83. ISBN 2-7302-1293-0. MR .
  • Metsänkylä, Tauno (2004), (PDF), Bulletin of the American Mathematical Society, 41 (1): 43–57, doi:, MR
  • Mihăilescu, Preda (2004), "Primary Cyclotomic Units and a Proof of Catalan's Conjecture", J. Reine Angew. Math., 2004 (572): 167–195, doi:, MR
  • Mihăilescu, Preda (2005), (PDF), European Congress of Mathematics, Zurich: Eur. Math. Soc.: 325–340, MR , archived from (PDF) on 2022-06-26
  • Ribenboim, Paulo (1994), Catalan's Conjecture, Boston, MA: Academic Press, Inc., ISBN 0-12-587170-8, MR Predates Mihăilescu's proof.
  • Tijdeman, Robert (1976), (PDF), Acta Arith., 29 (2): 197–209, doi:, MR

External links