On elementary proofs of the Prime Number Theorem for arithmetic progressions, without characters. (1993)

Cached

Download Links

by Andrew Granville
Citations:5 - 1 self

Active Bibliography

8 Integers, without large prime factors, in arithmetic progressions, II – Andrew Granville
Different Approaches to the Distribution of Primes – Andrew Granville - 2009
Prvosla Obsahuj Libovoln Dlouh Aritmetick Posloupnosti – Martin Klazar Vod, Martin Klazar
1 Asymptotic Density in Combined Number Systems – Karen Yeats
4 The Gelfond-Schnirelman Method In Prime Number Theory – Igor E. Pritsker
An Epic Drama: The Development of the Prime Number Theorem – Federico Santa María, Benjamin Fine A, Gerhard Rosenberger B
Typeset by A S-T X RABINOWITSCH REVISITED – Andrew Granville, Richard A. Mollin
3 Rabinowitsch Revisited – Andrew Granville, Richard A. Mollin
15 Explicit Bounds on Exponential Sums and the Scarcity of Squarefree Binomial Coefficients – Andrew Granville, Olivier Ramaré - 1996
1 The Möbius function and the residue theorem – Brian Conrad, Keith Conrad
On the PRIME NUMBER Lemma of Selberg – Filip Saidak - 2007
HYPOTHESIS H AND AN IMPOSSIBILITY – P. Pollack, Theorem Of, Ram Murty
ii Contents Notation – Martin Klazar - 2010
unknown title – Triantafyllos Xylouris - 709
7 Some studies on arithmetical chaos in classical and quantum mechanics – Jens Bolte - 1993
SHORT EFFECTIVE INTERVALS CONTAINING PRIMES IN ARITHMETIC PROGRESSIONS AND THE SEVEN CUBES PROBLEM – H. Kadiri
A modest improvement on the function S(T) – T. S. Trudgian - 2010
NUCLEI, PRIMES AND THE RANDOM MATRIX CONNECTION – Frank W. K. Firk, Steven J. Miller - 2009
3 An explicit zero-free region for the Dirichlet L-functions, ArXiv : math.NT/0510570 – H. Kadiri