On the Diophantine equation \(x (x + 1) \dots (x + n) + 1 = y^2\)

DOI10.3792/PJAA.76.16zbMath0996.11022OpenAlexW2041772319MaRDI QIDQ1570241

Nobuhisa Abe

Publication date: 4 November 2002

Published in: Proceedings of the Japan Academy. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3792/pjaa.76.16

zbMATH Keywords

Runge's methodconsecutive integers

Mathematics Subject Classification ID

Higher degree equations; Fermat's equation (11D41)

Related Items (2)

On the Diophantine equation \(x(x+1) \cdots (x+n)+1= y^2\) \((17\leq n= \text{odd}\leq 27)\) ⋮ Cover times for sequences of reversible Markov chains on random graphs

Cites Work

• The product of consecutive integers is never a power

This page was built for publication: On the Diophantine equation \(x (x + 1) \dots (x + n) + 1 = y^2\)