Computing solutions to the congruence \(1^n + 2^n + \ldots + n^n \equiv p \pmod n\)

DOI10.1016/j.dam.2018.05.022zbMath1461.11055arXiv1602.02407OpenAlexW2889547499WikidataQ57056816 ScholiaQ57056816MaRDI QIDQ2201763

Max A. Alekseyev, Antonio M. Oller-Marcén, José María Grau

Publication date: 17 September 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

algorithmpower sumsprimary pseudoperfect numbers

Mathematics Subject Classification ID

Computer solution of Diophantine equations (11Y50) Congruences in many variables (11D79)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• On the congruence \(1^m + 2^m + \ldots + m^m\equiv n \bmod m\) with \(n\mid m\)
• Solutions of the congruence 1+2f(n)+⋯+nf(n)≡0 mod n
• Reducing the Erdős–Moser Equation 1 n + 2 n + ⋯ + kn = (k + 1) n Modulo k and k 2
• Power-Sum Denominators
• On the equation $\sum_{p|N}\frac1p+\frac1N = 1$, pseudoperfect numbers, and perfectly weighted graphs
• Giuga's Conjecture on Primality

This page was built for publication: Computing solutions to the congruence \(1^n + 2^n + \ldots + n^n \equiv p \pmod n\)