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

preprint2009arXivOpen access

Abstract

If the equation of the title has an integer solution with k≥2k\ge2, then m>109.3⋅106m>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>10107m>10^{10^7}. Here we achieve m>10109m>10^{10^9} by showing that 2k/(2m−3)2k/(2m-3) is a convergent of log⁡2\log2 and making an extensive continued fraction digits calculation of (log⁡2)/N(\log2)/N, with NN an appropriate integer. This method is very different from that of Moser. Indeed, our result seems to give one of very few instances where a large scale computation of a numerical constant has an application.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.