A proof of Spence's formula using the reciprocity law for Dedekind sums
Steven Brown

TL;DR
This paper presents a new proof of Spence's formula involving Euler totient function sums, utilizing the reciprocity law for Dedekind sums, offering an alternative to previous proofs based on Fourier analysis.
Contribution
The paper introduces a novel proof of Spence's formula using Dedekind sums, expanding the mathematical tools applied to this number theory result.
Findings
Proof of Spence's formula using Dedekind sums
Connections to distribution analysis of coprime integers
Alternative approach to existing proofs
Abstract
In 1963, Edward Spence published a proof of the following With being Euler totient function, if is an integer, and if \begin{equation*} 0<a_1<\cdots<a_{\phi(n)}<n, \end{equation*} are the positive integers less than , coprime with , then \begin{equation*} \sum_{j=1}^{\phi(n)}ja_j = \frac{\phi(n)}{24}\left(8n\phi(n)+6n+2\phi(m)(-1)^{\omega(m)}-2^{\omega(m)}\right), \end{equation*} where is the square-free part of and is the number of prime factors of . Spence's proof relies on an ingenious observation considering Nagell's totient function. Later in 1971, Lucien Van Hamme provided an alternative proof of the result using Fourier analysis and previous work from Hubert Delange in 1968. In this paper I propose another proof of the formula using the reciprocity law for Dedekind sums. If the formula is of interest on its own, it also plays a role…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Mathematical Inequalities and Applications
