TOPICS
Search

Goormaghtigh Conjecture


The Goormaghtigh conjecture asserts that 31 and 8191 are the only integers that are repunits of length at least three in two distinct bases (Bennett et al. 2020, Grantham 2024). Equivalently, they are the only values of N satisfying the Diophantine equation

 N=(x^m-1)/(x-1)=(y^n-1)/(y-1)

in integers 2<=x<y and m>n>2.

The two known values are 31=(11111)_2=(111)_5 and 8191=(1111111111111)_2=(111)_(90). Both are Brazilian primes. Grantham (2024) showed that no other prime number less than 10^(700) has two such representations.


See also

Brazilian Number, Diophantine Equation, Repunit

Explore with Wolfram|Alpha

References

Bennett, M. A.; Gherga, A.; and Krešo, D. "An Old and New Approach to Goormaghtigh's Equation." Trans. Amer. Math. Soc. 373, 5707-5745, 2020. https://doi.org/10.1090/tran/8103.Grantham, J. "No New Goormaghtigh Primes up to 10^(700)." Integers 24, Article A98, 2024. https://doi.org/10.5281/zenodo.13992627.

Cite this as:

Weisstein, Eric W. "Goormaghtigh Conjecture." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/GoormaghtighConjecture.html

Subject classifications