📝 SummarXiv

Abstract

We introduce and study the arithmetic function E_m(n), defined as the sum of the remainders of n when divided by the first m positive integers. Although the definition is elementary, the function encodes rich arithmetic structure. In this first part we develop exact algebraic and combinatorial identities, including floor-sum and divisor-sum reformulations, quotient-residue decompositions, sharp bounds and extremal classes, and symmetry relations. We also establish a diagonal identity linking E_n(n) to the classical sum of divisors function, which leads to an exact equivalence characterizing primality in terms of differences of modular energy values. Additional results include congruence decompositions, recursion formulas, and structural properties when n<m, n>m, or when n or m is prime. These identities form the foundation for a second part, where analytic and asymptotic properties will be investigated.