Solutions of the congruence 1+2f(n)+ +n^f(n) 0 n
From MaRDI portal
Publication:2808128
DOI10.1002/MANA.201500057zbMATH Open1415.11007OpenAlexW2159277594MaRDI QIDQ2808128FDOQ2808128
Authors: José María Grau, Pieter Moree, Antonio M. Oller Marcén 
Publication date: 26 May 2016
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mana.201500057
Recommendations
Congruences; primitive roots; residue systems (11A07) Sequences and sets (11B99) Elementary number theory (11A99)
Cites Work
- On a variant of Giuga numbers
- Giuga's Conjecture on Primality
- A Note on Giuga's Conjecture
- Das asymptotische Verhalten von Summen über multiplikative Funktionen
- Proofs of power sum and binomial coefficient congruences via Pascal's identity
- A Top Hat for Moser’s Four Mathemagical Rabbits
- Moser's mathemagical work on the equation \(1^k+2^k+\ldots+(m-1)^k=m^k\)
- Title not available (Why is that?)
- Diophantine equations of Erdös-Moser type
- The Staudt-Clausen Theorem
- Chebyshev’s bias for composite numbers with restricted prime divisors
- Shorter Notes: On Some Products Involving Primes
Cited In (6)
- On power sums of matrices over a finite commutative ring
- Reducing the Erdős–Moser Equation 1 n + 2 n + ⋯ + kn = (k + 1) n Modulo k and k 2
- On \(\mu\)-Sondow numbers
- Power sums over finite commutative unital rings
- Title not available (Why is that?)
- Computing solutions to the congruence \(1^n + 2^n + \ldots + n^n \equiv p \pmod n\)
This page was built for publication: Solutions of the congruence \(1+2^{f(n)}+\ldots +n^{f(n)}\equiv 0 \pmod n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808128)
