2000 character limit reached
On the equality of Dedekind sums
Published 12 Feb 2021 in math.NT | (2102.06374v2)
Abstract: We show that deciding the equality of two Dedekind sums $S(c,b)$, $S(d,b)$ is equivalent to deciding whether a Dedekind sum defined by $b, c, d$ takes a certain value. By means of this result we construct infinite sequences of pairwise equal Dedekind sums. Moreover, we prove a result that says how many Dedekind sums $S(d,b)$, $1\le d\le b-1$, may be equal to a given $S(c,b)$ if $b$ is a square-free number.
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.