We give an upper bound for some exponential sums over primes, using only sieve methods and Chebyshev's estimate on primes.
Exponential sums and integrals over convex polytopes
โ Scribed by A. I. Barvinok
- Publisher
- Springer US
- Year
- 1992
- Tongue
- English
- Weight
- 228 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0016-2663
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametr
Evaluation of some exponential sums over i l finite field By L. CAF~LITZ of Durham (U.S.A.) (Eingegangen am 10.7.1978) 1. Introduction. Let Fq = QF(q) denote the finite field of order q = p", p prime, n 2 1. For a E Fq put t(a) = a + up + + up"-' and e(a) = p i W / p , so that t(aP) = t(a), e(aP) =