Divisibility Properties of Integers x, k Satisfying 1 k + ⋯+ (x - 1) k = x k

DOI10.2307/2153300zbMath0816.11024OpenAlexW2074459346MaRDI QIDQ4317678

Pieter Moree, Jerzy Urbanowicz, Herman J. J. te Riele

Publication date: 20 December 1994

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2153300

zbMATH Keywords

divisibilityBernoulli sumsexponential diophantine equationErdős- Moser equationextremely large solutions

Mathematics Subject Classification ID

Bernoulli and Euler numbers and polynomials (11B68) Computer solution of Diophantine equations (11Y50) Exponential Diophantine equations (11D61)

Related Items (6)

Forbidden Integer Ratios of Consecutive Power Sums ⋮ The Erdős–Moser equation $1^{k}+2^{k}+\dots+(m-1)^{k}=m^{k}$ revisited using continued fractions ⋮ A note on the equation \(1^ k+2^ k+\cdots+(x-1)^ k=y^ m\) ⋮ Moser's mathemagical work on the equation \(1^k+2^k+\ldots+(m-1)^k=m^k\) ⋮ Divisibility of power sums and the generalized Erdős-Moser equation ⋮ Diophantine equations of Erdös-Moser type

This page was built for publication: Divisibility Properties of Integers x, k Satisfying 1 k + ⋯+ (x - 1) k = x k