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

DOI10.4064/aa-83-1-87-92zbMath0896.11012OpenAlexW943751985MaRDI QIDQ4385577

Kálmán Győry

Publication date: 20 April 1998

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/aa-83-1-87-92

zbMATH Keywords

arithmetic progressionsexponential equationproduct of consecutive positive integers

Mathematics Subject Classification ID

Exponential Diophantine equations (11D61) Higher degree equations; Fermat's equation (11D41) Multiplicative and norm form equations (11D57)

Related Items (11)

On products of disjoint blocks of arithmetic progressions and related equations ⋮ Equal values of figurate numbers ⋮ The Diophantine equation f(x)=g(y)$f(x)=g(y)$ for polynomials with simple rational roots ⋮ On a problem of Erdős and Graham ⋮ Diophantine equations with products of consecutive values of a quadratic polynomial ⋮ Almost fifth powers in arithmetic progression ⋮ Almost perfect powers in consecutive integers. II ⋮ A remark on Jeśmanowicz' conjecture for the non-coprimality case ⋮ Polynomial products modulo primes and applications ⋮ On the Diophantine equations \(\binom n2=cx^l\) and \(\binom n3=cx^l\). ⋮ Binomial coefficients and Lucas sequences

This page was built for publication: On the diophantine equation $n(n+1)...(n+k-1) = bx^l$