On the diophantine equation $n(n+1)...(n+k-1) = bx^l$ (Q4385577)

In 1975 \textit{P. Erdős} and \textit{J. L. Selfridge} [Ill. J. Math. 19, 292-301 (1975; Zbl 0295.10017)] proved that the product of consecutive positive integers is never a perfect power. Since then a number of similar problems have been investigated by Győry, Saradha, Shorey and Tijdeman (see [\textit{K. Győry}, Acta Arith. 80, 289-295 (1997; Zbl 0871.11022) and \textit{N. Saradha}, On perfect powers in products with terms from arithmetic progressions, Acta Arith. 82, 147-172 (1997)] and the references therein). Let \(P(x)\) be the greatest prime divisor of \(x\). In the present paper the author considers the title equation in positive integers \(n,k,b,x,\ell\) with \(k\geq 2\), \(\ell\geq 2\), \(P(b)\leq k\), and where \(b\) is \(\ell\)th power free. For given \(k\), this equation is solvable with \(P(x)\leq k\) and all such solutions can be determined. Hence \(P(x)>k\) is the more interesting case. The author provides a complete solution of the title equation under the latter assumption.