SearcharxivSearch

arXiv subjects

Steven Brown

Publications and source records attributed to Steven Brown.

5 recordsLinked to original sources

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

In 1963, Edward Spence published a proof of the following With $\phi$ being Euler totient function, if $n>1$ is an integer, and if \begin{equation*} 0<a_1<\cdots<a_{\phi(n)}<n, \end{equation*} are the positive integers less than $n$, coprime with $n$, 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 $m$ is the square-free part of $n$ and $\omega(m)$ is the number of prime factors of $m$. 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 in the analysis of the distribution of the $a_j$ as suggested by the work from Hubert Delange.

math.NT

On a family of sums of powers of the floor function and their links with generalized Dedekind sums

In this paper we are concerned with a family of sums involving the floor function. With $r$ a non negative integer and $n$ and $m$ positive integers we consider the sums \begin{equation*}\mathbf{S}_{r}\left(n,m\right)=\sum_{k=1}^{n-1}{\left\lfloor \frac{km}{n}\right\rfloor}^r\end{equation*} While a formula for $\mathbf{S}_1$ is well known, we provide closed-form formulas for $\mathbf{S}_2$ and $\mathbf{S}_3$ as well as the reciprocity laws they satisfy. Additionally, one can find a closed-form formula for the classical Dedekind sum using the Euclidean algorithm. Finally, we provide a general formula for $\mathbf{S}_r$ showing its dependency on generalized Dedekind sums.

math.NT

Evolutionary modelling reveals melodic and harmonic constraints on global scale structure

Since antiquity, musical scales have been explained by harmony rather than melody. This view relies on the mathematically designed scales of a few traditions, and was never directly tested. Testing it requires cross-cultural data and a method that judges theories by what they get wrong as well as right. We provide both, modelling scale evolution across 1,314 scales from 96 countries. A Melody model explains the near-universal preference for step-sizes of 1-3 semitones, and matches independent data from melodies, singing, and psychoacoustics. Harmony does far less: it explains the music-theoretic scales, but in those measured from performance it adds only a weak bias towards fourths, fifths, and octaves. Harmony's importance has been overstated, likely due to the historical focus on music-theoretic rather than measured scales. Melody is the primary driver of global scale structure; harmonic constraints are less impactful and mainly reflect musicological theory over musical performance.

cs.SD

Distance between consecutive elements of the multiplicative group of integers modulo $n$

For a prime number $p$, we consider its primorial $P:=p\#$ and $U(P):={\left(\mathbb{Z}/P\mathbb{Z}\right)}^\times$ the set of elements of the multiplicative group of integers modulo $P$ which we represent as points anticlockwise on a circle of perimeter $P$. These points considered with wrap around modulo $P$ are those not marked by the Eratosthenes sieve algorithm applied to all primes less than or equal to $p$. In this paper, we are concerned with providing formulas to count the number of gaps of a given even length $D$ in $U(P)$ which we note $K(D,P)$.

math.NT

An alternative proof of Sylvester's theorem and variations for more primes

This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger versions of Sylvester's theorem and Bertrand's postulate with more primes, as well as an approach to get more results in this direction.

math.NT