A congruence modulo n3 involving two consecutive sums of powers and its applications
Abstract
For various positive integers k, the sums of kth powers of the first n positive integers, Sk(n+1)=1k+2k+...+nk, have got to be some of the most popular sums in all of mathematics. In this note we prove that for each k 2 2S2k+1(n)- (2k+1)nS2k(n) \arrayll 0\,(\,n3) & if\,\,k\,\, is\,\,even\,\,or\,\, n\,\, is\,\, odd & or \,\, n 0\,(\,4) n32\,(\,n3) & if\,\,k\,\, is\,\, odd &,\, and\,\, n 2\,(\,4). array. The above congruence allows us to state an equivalent formulation of Giuga's conjecture. Moreover, we prove that the first above congruence is satisfied modulo n4 whenever n 5 is a prime number such that n-1 2k-2. In particular, this congruence arises a conjecture for a prime to be Wolstenholme prime. We also propose several Giuga-Agoh's-like conjectures. Further, we establish two congruences modulo n3 for two binomial type sums involving sums of powers S2i(n) with i=0,1,...,k. Furthermore, using the above congruence reduced modulo n2$, we obtain an extension of Carlitz-von Staudt result for odd power sums.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.