The Erdős–Moser equation $1^{k}+2^{k}+\dots+(m-1)^{k}=m^{k}$ revisited using continued fractions
From MaRDI portal
Publication:3168749
DOI10.1090/S0025-5718-2010-02439-1zbMath1231.11038arXiv0907.1356WikidataQ55953132 ScholiaQ55953132MaRDI QIDQ3168749
Pieter Moree, Wadim Zudilin, Yves Gallot
Publication date: 19 April 2011
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.1356
11A55: Continued fractions
11D61: Exponential Diophantine equations
11Y65: Continued fraction calculations (number-theoretic aspects)
Related Items
Primary Pseudoperfect Numbers, Arithmetic Progressions, and the Erdős-Moser Equation, Forbidden Integer Ratios of Consecutive Power Sums, Moser's mathemagical work on the equation \(1^k+2^k+\ldots+(m-1)^k=m^k\), On stronger conjectures that imply the Erdős-Moser conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Über eine Verallgemeinerung der Bernoullischen Ungleichung. (On a generalization of Bernoulli's inequality)
- On the real zeros of Bernoulli polynomials.
- A Note on The Metrical Theory of Continued Fractions
- A Top Hat for Moser’s Four Mathemagical Rabbits
- On the Prime Divisors of the Sequence W n +1 = 1 + W 1 …W n
- Geodesics on modular surfaces and continued fractions
- Divisibility Properties of Integers x, k Satisfying 1 k + ⋯+ (x - 1) k = x k
- On the equation $\sum_{p|N}\frac1p+\frac1N = 1$, pseudoperfect numbers, and perfectly weighted graphs
- Diophantine equations of Erdös-Moser type
- Sequences of Enumerative Geometry: Congruences and Asymptotics
- On Schönhage's algorithm and subquadratic integer gcd computation
- An Extension of Bernoulli's Inequality
- On Artin's conjecture.
- The Staudt-Clausen Theorem
- Unsolved problems in number theory
