English

A computable formula for evaluating the mean square sum of $L$-functions

Number Theory 2023-12-13 v2

Abstract

For Dirichlet characters χ\chi mod kk where k3k\geq 3, we here give a computable formula for evaluating the mean square sums χ mod kχ(1)=(1)rL(r,χ)2\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2 for any positive integer r3r\geq 3. We also give an inductive formula for computing the sum 1mk(m,k)=11(sin(πmk))2n\sum\limits_{\substack{1\leq m\leq k \\ (m, k)=1}}\frac{1}{\left(\sin\left(\frac{\pi m}{k}\right)\right)^{2n}} where nn is a positive integer in terms of Bernoulli numbers and binomial coefficients.

Keywords

Cite

@article{arxiv.2307.01889,
  title  = {A computable formula for evaluating the mean square sum of $L$-functions},
  author = {Neha Elizabeth Thomas and K Vishnu Namboothiri},
  journal= {arXiv preprint arXiv:2307.01889},
  year   = {2023}
}
R2 v1 2026-06-28T11:22:09.887Z