Abstract
In this paper we study the sum of powers of the Gaussian integers \(\mathbf {G}_k(n):=\sum _{a,b \in [1,n]} (a+b i)^k\). We give an explicit formula for \(\mathbf {G}_k(n) \pmod n\) in terms of the prime numbers \(p \equiv 3 \pmod 4\) with \(p \mid \mid n\) and \(p-1 \mid k\), similar to the well known one due to von Staudt for \(\sum _{i=1}^n i^k \pmod n\). We apply this result to study the set of integers \(n\) which divide \(\mathbf {G}_n(n)\) and compute its asymptotic density with six exact digits: \(0.971000\ldots \).
Similar content being viewed by others
References
Beardon, A.F.: Sums of powers of integers. Am. Math. Month. 103(3), 201–213 (1996)
Carlitz, L.: The Staudt–Clausen theorem. Math. Mag. 34, 131–146 (1960–1961)
Grau, J.M., Oller-Marcén, A.M.: About the congruence \(\sum _{k=1}^n k^{f(n)} \equiv 0 (mod n)\). Preprint (2013). arXiv:1304.2678
Kellner, B.C.: On the theorems of Von Staudt and Clausen. (In preparation)
Lengyel, T.: On divisibility of some power sums. Integers 7:A41, 6 (2007)
MacMillan, K., Sondow, J.: Divisibility of power sums and the generalized Erdős–Moser equation. Elem. Math. 67(4), 182–186 (2012)
Moree, P.: On a theorem of Carlitz-von Staudt. C. R. Math. Rep. Acad. Sci. Can. 16(4), 166–170 (1994)
Sloane, N.J.A.: The on-line encyclopedia of integer sequences. https://oeis.org
Sondow, J., MacMillan, K.: Reducing the Erdős–Moser equation \(1^n+2^n+\cdots +k^n=(k+1)^n\) modulo \(k\) and \(k^2\). Preprint (2010). arXiv:1011.2154
Sondow, J., MacMillan, K.: Reducing the Erdős–Moser equation \(1^n+2^n+\cdots +k^n=(k+1)^n\) modulo \(k\) and \(k^2\). Integers 11, A34, 8, (2011)
von Staudt, K.G.C.: Beweis eines Lehrsatzes die Bernoullischen Zahlen betreffend. J. Reine Angew. Math 21, 372–374 (1840)
Dilcher, K.: Congruences for a class of alternating lacunary sums of binomial coeficients. J. Integer Seq. 10 Article (2007)
Hermite, Ch.: Extrait d’une lettre a M. Borchardt. J. Reine Angew. Math. 81, 93–95 (1876)
Bachmann, P.: Niedere Zahlentheorie, Part 2, Teubner, Leipzig: parts 1 and 2 reprinted in one volume. Chelsea, New York, (1910) (1968)
Mathar, R.J.: Table of Dirichlet L-series and prime zeta modulo functions for small moduli (2010). arXiv:1008.2547
Moser, L.: On the Diophantine equation \(1^n+2^n+3^n+\cdots +(m-1)^n =m^n\). Scr. Math. 19, 84–88 (1953)
Butske, W., Jaje, L.M., Mayernik, D.R.: On the equation \(\sum _{P \mid N} \frac{1}{P}+\frac{1}{N}=1\), pseudoperfect numbers, and perfectly weighted graphs. Math. Comp 69, 407–420 (2000)
Moree, P.: Moser’s mathemagical work on the equation \(1^k+2^k+\cdots +(m-1)^k=m^k\). Rocky Mt. J. Math. 5, 1707–1737 (2013)
Guy, R.: Unsolved problems in number theory, 2nd edn. Springer, New York (2004)
Schultz, H.J.: The sums of the kth powers of the first n integers Amer. Math. Mon. 87, 478–481 (1980)
Boyer, C.B.: Pascal’s formula for the sums of powers of the integers. Scr. Math. 9, 237–244 (1943)
Acknowledgments
The authors wish to thank Jonathan Sondow for his useful comments and remarks.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J. Schoißengeier.
Rights and permissions
About this article
Cite this article
Fortuny Ayuso, P., Grau, J.M. & Oller-Marcén, A.M. A von Staudt-type result for \({\sum _{z\in \mathbb {Z}_n[i]} z^k }\) . Monatsh Math 178, 345–359 (2015). https://doi.org/10.1007/s00605-015-0736-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00605-015-0736-5