Abstract
Let be the Dirichlet -function associated to a non trivial primitive Dirichlet character defined , where is an odd prime. In this paper we introduce a fast method to compute using the values of Euler's function. We also introduce an alternative way of computing and ,. Using such algorithms we numerically verify the classical Littlewood bounds and the recent Lamzouri-Li-Soundararajan estimates on , where runs over the non trivial primitive Dirichlet characters , for every odd prime up to . The programs used and the results here described are collected at the following address \url{http://www.math.unipd.it/~languasc/Littlewood_ineq.html}.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.