In mathematics, the Goormaghtigh conjecture is a conjecture in number theory named for the Belgian mathematician René Goormaghtigh. The conjecture is that the only non-trivial integer solutions of the exponential Diophantine equation

${\displaystyle {\frac {x^{m}-1}{x-1))={\frac {y^{n}-1}{y-1))}$

satisfying ${\displaystyle x>y>1}$ and ${\displaystyle n,m>2}$ are

${\displaystyle {\frac {5^{3}-1}{5-1))={\frac {2^{5}-1}{2-1))=31}$

and

${\displaystyle {\frac {90^{3}-1}{90-1))={\frac {2^{13}-1}{2-1))=8191.}$

Partial results

Davenport, Lewis & Schinzel (1961) showed that, for each pair of fixed exponents ${\displaystyle m}$ and ${\displaystyle n}$, this equation has only finitely many solutions. But this proof depends on Siegel's finiteness theorem, which is ineffective. Nesterenko & Shorey (1998) showed that, if ${\displaystyle m-1=dr}$ and ${\displaystyle n-1=ds}$ with ${\displaystyle d\geq 2}$, ${\displaystyle r\geq 1}$, and ${\displaystyle s\geq 1}$, then ${\displaystyle \max(x,y,m,n)}$ is bounded by an effectively computable constant depending only on ${\displaystyle r}$ and ${\displaystyle s}$. Yuan (2005) showed that for ${\displaystyle m=3}$ and odd ${\displaystyle n}$, this equation has no solution ${\displaystyle (x,y,n)}$ other than the two solutions given above.

Balasubramanian and Shorey proved in 1980 that there are only finitely many possible solutions ${\displaystyle (x,y,m,n)}$ to the equations with prime divisors of ${\displaystyle x}$ and ${\displaystyle y}$ lying in a given finite set and that they may be effectively computed. He & Togbé (2008) showed that, for each fixed ${\displaystyle x}$ and ${\displaystyle y}$, this equation has at most one solution. For fixed x (or y), equation has at most 15 solutions, and at most two unless x is either odd prime power times a power of two, or in the finite set {15, 21, 30, 33, 35, 39, 45, 51, 65, 85, 143, 154, 713}, in which case there are at most three solutions. Furthermore, there is at most one solution if the odd part of n is squareful unless n has at most two distinct odd prime factors or n is in a finite set {315, 495, 525, 585, 630, 693, 735, 765, 855, 945, 1035, 1050, 1170, 1260, 1386, 1530, 1890, 1925, 1950, 1953, 2115, 2175, 2223, 2325, 2535, 2565, 2898, 2907, 3105, 3150, 3325, 3465, 3663, 3675, 4235, 5525, 5661, 6273, 8109, 17575, 39151}.

Application to repunits

The Goormaghtigh conjecture may be expressed as saying that 31 (111 in base 5, 11111 in base 2) and 8191 (111 in base 90, 1111111111111 in base 2) are the only two numbers that are repunits with at least 3 digits in two different bases.