Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Moser's mathemagical work on the equation 1^k+2^k+...+(m-1)^k=m^k (1011.2940v2)

Published 12 Nov 2010 in math.NT

Abstract: If the equation of the title has an integer solution with k>=2, then m>10{106}. Leo Moser showed this in 1953 by amazingly elementary methods. With the hindsight of more than 50 years his proof can be somewhat simplified. We give a further proof showing that Moser's result can be derived from a von Staudt-Clausen type theorem. Based on more recent developments concerning this equation, we derive a new result using the divisibility properties of numbers in the sequence 2{2e+1}+1, e=0,1,2,..... In the final section we show that certain Erdos-Moser type equations arising in a paper of Kellner can be solved completely.

Summary

We haven't generated a summary for this paper yet.