A complete resolution of a problem of Erdős and Graham (Q1359162)

\textit{B. Brindza} and \textit{P. Erdős} [J. Aust. Math. Soc., Ser. A 51, No. 1, 1-7 (1991; Zbl 0746.11021)] proved that the equation \[ (p-1)!+ a^{p-1}= p^k,\tag{\(*\)} \] \(a, k\in\mathbb{N}\), \(p\) an odd prime, has only a finite number of solutions \((p,a,k)\) and all solutions satisfy \(\max(p,a,k)< C\), where \(C\) is an effectively computable absolute constant. In the present paper, the authors prove that \((*)\) has only the solutions \((p,a,k)= (3,1,1)\), \((3,5,3)\) and \((5,1,2)\). The proof depends on an estimate for linear forms in logarithms of algebraic numbers by \textit{M. Laurent}, \textit{M. Mignotte} and \textit{Y. Nesterenko} [J. Number Theory 55, No. 2, 285-321 (1995; Zbl 0843.11036)]. \{Reviewer's remark: A similar result has been proved by \textit{M. Le} [Publ. Math. 48, No. 1-2, 145-149 (1996; Zbl 0867.11020)]\}.