• On Diophantine Equations of the Form $(x-a_1)(x-a_2)\ldots(x-a_k)+r=y^n$

    • Fulltext


        Click here to view fulltext PDF

      Permanent link:

    • Keywords


      Diophantine equations; Erdős–Selfridge.

    • Abstract


      Erdős and Selfridge [3] proved that a product of consecutive integers can never be a perfect power. That is, the equation $x(x+1)(x+2)\ldots(x+(m-1))=y^n$ has no solutions in positive integers $x,m,n$ where $m,n>1$ and $y\in Q$. We consider the equation


      where $0\leq a_1 < a_2 <\cdots < a_k$ are integers and, with $r\in Q,n\geq 3$ and we prove a finiteness theorem for the number of solutions 𝑥 in $Z,y$ in 𝑄. Following that, we show that, more interestingly, for every nonzero integer $n>2$ and for any nonzero integer 𝑟 which is not a perfect 𝑛-th power for which the equation admits solutions, 𝑘 is bounded by an effective bound.

    • Author Affiliations


      Manisha Kulkarni1 B Sury2

      1. Poornaprajna Institute of Scientific Research, Devanahalli, Bangalore 562 110, India
      2. Statistics & Mathematics Unit, Indian Statistical Institute, 8th Mile, Mysore Road, Bangalore 560 059, India
    • Dates

  • Proceedings – Mathematical Sciences | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2023-2024 Indian Academy of Sciences, Bengaluru.