2000 character limit reached
On a criterion for the equality of Dedekind Sums
Published 17 Apr 2013 in math.NT | (1304.4716v1)
Abstract: In [3] it was shown that the Dedekond sums $s(m_1,n)$ and $s(m_2,n)$ are equal only if $(m_1m_2-1)(m_1-m_2)\equiv 0$ mod $n$. Here we show that the latter condition is equivalent to $12s(m_1,n)-12s(m_2,n)\in \Z$. In addition, we determine, for a given number $m_1$, the number of integers $m_2$ in the range $0\le m_2<n$, $(m_1,m_2)=1$, such that $12s(m_1,n)-12s(m_2,n)\in \Z$, provided that $n$ is square-free.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.