Sur L'equation Diophantienne (xn-1)/(x-1)=yq, III

In this paper we study the diophantine equation of the title,which was first introduced by Nagell and Ljunggren during thefirst half of the twentieth century. We describe a method whichallows us, on the one hand when n is fixed, to obtain an upperbound for q, and on the other hand when n and q are fixed, toobtain upper bounds for x and y which are far sharper than thosederived from the theory of linear forms in logarithms. We alsoshow how these bounds can be used even when they seem too largefor a straightforward enumeration of the remaining possiblevalues of x. By combining all these techniques, we are ableto solve the equation in many cases, including the case whenn has a prime divisor less than 13, or the case when n has aprime divisor which is less than or equal to 23 and distinctfrom q. 2000 Mathematical Subject Classification: primary 11D41;secondary 11J86, 11Y50.