Analytic Number Theory pp 349-366 | Cite as
The Coefficients of Cyclotomic Polynomials
Chapter
Abstract
Let \(
{_n}(z) = \sum\nolimits_{m = o}^{(n)} {a(m,n){z^m}}
\) be the nth cyclotomic polynomial. Let and let .
$$
A\left( n \right)\, = \,\mathop {\max }\limits_{0\, \leqslant \,m\, \leqslant \,\phi \,\left( n \right)} \,\left| {a\,\left( {m,\,n} \right)} \right|
$$
(1.1)
$$
S\left( n \right)\, = \,\sum\limits_{0\, \leqslant \,m\, \leqslant \,\phi \,\left( n \right)\,} {\left| {a\,\left( {m,n} \right)} \right|} .
$$
Keywords
Prime Factor Prime Divisor Chinese Remainder Theorem Asymptotic Density Prime Number Theorem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- [1]P. Bateman, C. Pomerance, and R. C. Vaughan, On the size of the ocefficients of the cyclotomic polynomial, Coll. Math. Soc. J. Bolyai (1981), 171–202.Google Scholar
- [2]N. G. de Bruijn, On the number of positive integers ≤ x and free of prime factors > y, Nederl. Akad. Wetensch. Proc. Ser. A 54 (1951), 50–60.MATHGoogle Scholar
- [3]P.D.T.A. Elliott, Probabilistic Number Theory I, II, Springer-Verlag, New York, 1979/1980.Google Scholar
- [4]H. Halberstam, H.-E. Richert, Sieve Methods, Academic Press, London, 1974.MATHGoogle Scholar
- [5]H. Maier and G. Tenenbaum, On the set of divisors of an integer, Invent. Math. 76 (1984), 121–128.MathSciNetMATHCrossRefGoogle Scholar
Copyright information
© Bikhäuser Boston 1990