About the congruence Σk=1n kf(n) 0 (mod n)
Abstract
In this paper we characterize, in terms of the prime divisors of n, the pairs (k,n) for which n divides Σj=1n jk. As an application, we study the sets Mf :=\n: n divides Σj=1n jf(n) \ for some choices of f.
0
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.