A note on the Goormaghtigh equation (Q2322536)

On hundred years ago, R. Goormaghtigh conjectured that the equation \((x^m-1)/(x-1)=(y^n-1)/(y-1)\) has only the positive integer solutions \((x,y,m,n)=(2,5,5,3)\) and \((2,90,13,3)\) with \(y>x>1\) and \(m>n>2.\) Goormaghtigh's conjecture was solved for some special cases. But, in general, the problem is far from settled. This problem is also related to some subjects of combinatorial mathematics. In this respect, \textit{K. H. Leung} et al. [J. Comb. Theory, Ser. A 115, No. 1, 147--177 (2008; Zbl 1131.51004)] proved that if \( (x, y)=(2, 3),\) then Goormaghtigh's conjecture is true. Let \(p\) be an odd prime, and let \((u_1, v_1)\) denote the least solution of Pell's equation \(u^2-2(p-1)(p-2)v^2=1.\) In this paper, using Baker's method, the authors prove that if \((x,y)=(2,p),p>10^{24},\) 2 is a primitive root module \(p\) and \(\log(u_1+v_1\sqrt{2(p-1)(p-2)})<p^{2/3},\) then Goormaghtigh's conjecture is true.