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

@article{Gallot2011TheEE,
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.},
year={2011},
volume={80},
pages={1221-1237}
}
• 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

References

SHOWING 1-10 OF 45 REFERENCES
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
• Mathematics, Computer Science
• Am. Math. Mon.
• 2000
• 4
Znam's Problem
• Mathematics
• 2002
• 6
• Highly Influential
A course in computational algebraic number theory
• H. Cohen
• Mathematics, Computer Science