ON THE LEAST n WITH {chi}(n) != 1 |
| |
| Authors: | Baier Stephan |
| |
| Institution: | Queen's University, Jeffery Hall, Department of Mathematics and Mathematical Statistics, University Ave., Kingston, ON, Canada K7L 3N6 |
| |
| Abstract: | Suppose that a > 1. By using a method of Linnik employinghis Large Sieve one may derive the following result. The numberof primitive Dirichlet characters  with conductor  Q such that(n) = 1 for all n (log Q)a is O(Q2/a+ ). We improve the exponent2/a for a > 2 by using a refined version by Heath-Brown ofthe Halasz–Montgomery ‘Large Values method’. |
| |
| Keywords: | |
| 本文献已被 Oxford 等数据库收录！ |
|
