We study the double character sum $\sum \limits _{\substack {m\leq X,\\m\mathrm {\ odd}}}\sum \limits _{\substack {n\leq Y,\\n\mathrm {\ odd}}}\left (\frac {m}{n}\right )$ and its smoothly weighted counterpart. An asymptotic formula with power saving error term was obtained by Conrey, Farmer, and Soundararajan by applying the Poisson summation formula. The result is interesting because the main term involves a non-smooth function. In this paper, we apply the inverse Mellin transform twice and study the resulting double integral that involves a double Dirichlet series. This method has two advantages—it leads to a better error term, and the surprising main term naturally arises from three residues of the double Dirichlet series.

Let $a_1$ , $a_2$ , and $a_3$ be distinct reduced residues modulo q satisfying the congruences $a_1^2 \equiv a_2^2 \equiv a_3^2 \ (\mathrm{mod}\ q)$ . We conditionally derive an asymptotic formula, with an error term that has a power savings in q, for the logarithmic density of the set of real numbers x for which $\pi (x;q,a_1)> \pi (x;q,a_2) > \pi (x;q,a_3)$ . The relationship among the $a_i$ allows us to normalize the error terms for the $\pi (x;q,a_i)$ in an atypical way that creates mutual independence among their distributions, and also allows for a proof technique that uses only elementary tools from probability.