Results 1 -
3 of
3
Large Character Sums
- CHARACTERS AND THE POLYA-VINOGRADOV THEOREM 29
"... A central problem in analytic number theory is to gain an understanding of character sums χ(n), n≤x ..."
Abstract
-
Cited by 12 (6 self)
- Add to MetaCart
A central problem in analytic number theory is to gain an understanding of character sums χ(n), n≤x
Arbitrarily Tight Bounds On The Distribution Of Smooth Integers
- Proceedings of the Millennial Conference on Number Theory
, 2002
"... This paper presents lower bounds and upper bounds on the distribution of smooth integers; builds an algebraic framework for the bounds; shows how the bounds can be computed at extremely high speed using FFT-based power-series exponentiation; explains how one can choose the parameters to achieve ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
This paper presents lower bounds and upper bounds on the distribution of smooth integers; builds an algebraic framework for the bounds; shows how the bounds can be computed at extremely high speed using FFT-based power-series exponentiation; explains how one can choose the parameters to achieve any desired level of accuracy; and discusses several generalizations.
