Moser's mathemagical work on the equation \(1^k+2^k+\ldots+(m-1)^k=m^k\)

DOI10.1216/RMJ-2013-43-5-1707zbMath1362.11045arXiv1011.2940OpenAlexW2963062962MaRDI QIDQ380214

Pieter Moree

Publication date: 13 November 2013

Published in: Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.2940

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Exponential Diophantine equations (11D61)

Related Items (6)

Forbidden Integer Ratios of Consecutive Power Sums ⋮ A von Staudt-type result for \(\sum _{z\in \mathbb {Z}_n[i} z^k\)] ⋮ Solutions of the congruence 1+2f(n)+⋯+nf(n)≡0 mod n ⋮ Integer Ratios of Consecutive Alternating Power Sums ⋮ On a conjecture of Schäffer concerning the equation \(1^k + \ldots + x^k = y^n\) ⋮ On the congruence \(1^m + 2^m + \ldots + m^m\equiv n \bmod m\) with \(n\mid m\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On stronger conjectures that imply the Erdős-Moser conjecture
• On Fermat varieties
• The lengths of Hermitian self-dual extended duadic codes
• On primes \(p\) for which \(d\) divides \(\text{ord}_p(g)\)
• Divisibility of power sums and the generalized Erdős-Moser equation
• Biographical sketch. Leo Moser
• On the representation of \(-1\) as a sum of two-squares in an algebraic number field
• Approximate formulas for some functions of prime numbers
• Proofs of Power Sum and Binomial Coefficient Congruences Via Pascal’s Identity
• Computing prime harmonic sums
• Reducing the Erdős–Moser Equation 1 n + 2 n + ⋯ + kn = (k + 1) n Modulo k and k 2
• The Erdős–Moser equation $1^{k}+2^{k}+\dots+(m-1)^{k}=m^{k}$ revisited using continued fractions
• A Top Hat for Moser’s Four Mathemagical Rabbits
• Roots of unity and nullity modulo $n$
• PRIMES IN A PRESCRIBED ARITHMETIC PROGRESSION DIVIDING THE SEQUENCE $\{a^k+b^k\}_{k=1}^{\infty}$
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
• Divisibility Properties of Integers x, k Satisfying 1 k + ⋯+ (x - 1) k = x k
• On the divisors of $a^k + b^k$
• On the Diophantine equation $1^k+2^k+\dotsb+x^k=y^n$
• On the equation $\sum_{p|N}\frac1p+\frac1N = 1$, pseudoperfect numbers, and perfectly weighted graphs
• Density of prime divisors of linear recurrences
• Diophantine equations of Erdös-Moser type
• Artin's Primitive Root Conjecture – A Survey
• On Self-Dual Cyclic Codes Over Finite Fields
• The Staudt-Clausen Theorem

This page was built for publication: Moser's mathemagical work on the equation \(1^k+2^k+\ldots+(m-1)^k=m^k\)