2000 character limit reached
The number of Dedekind sums with equal fractional parts
Published 17 Sep 2013 in math.NT | (1309.4226v3)
Abstract: In a previous it was shown that the Dedkind sums $12s(m,n)$ and $12s(x,n)$, $1\le m,x\le n$, $(m,n)=(x,n)=1$, are equal mod $\Z$ if, and only if, $(x-m)(xm-1)\equiv 0$ mod $n$. Here we determine the cardinality of numbers $x$ in the above range that satisfy this congruence for a given number $m$.
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.