The Erdős-Moser equation 1k+2k+...+(m-1)k=mk revisited using continued fractions

  title={The Erdős-Moser equation 1k+2k+...+(m-1)k=mk revisited using continued fractions},
  author={Y. Gallot and P. Moree and W. Zudilin},
  journal={Math. Comput.},
  • Y. Gallot, P. Moree, W. Zudilin
  • Published 2011
  • Mathematics, Computer Science
  • Math. Comput.
  • If the equation of the title has an integer solution with $k\ge2$, then $m>10^{9.3\cdot10^6}$. This was the current best result and proved using a method due to L. Moser (1953). This approach cannot be improved to reach the benchmark $m>10^{10^7}$. Here we achieve $m>10^{10^9}$ by showing that $2k/(2m-3)$ is a convergent of $\log2$ and making an extensive continued fraction digits calculation of $(\log2)/N$, with $N$ an appropriate integer. This method is very different from that of Moser… CONTINUE READING
    9 Citations

    Tables and Topics from this paper.


    Diophantine equations of Erdös-Moser type
    • 15
    On Artin's conjecture.
    • 380
    • Highly Influential
    On Schönhage's algorithm and subquadratic integer gcd computation
    • N. Möller
    • Computer Science, Mathematics
    • Math. Comput.
    • 2008
    • 55
    • PDF
    A Note on The Metrical Theory of Continued Fractions
    • 4
    On a theorem of Carlitz
    • 7
    • PDF
    Znam's Problem
    • 6
    • Highly Influential
    A course in computational algebraic number theory
    • H. Cohen
    • Mathematics, Computer Science
    • Graduate texts in mathematics
    • 1993
    • 2,521
    Unsolved Problems in Number Theory
    • 1,090
    • PDF