10.12.2012 Views

Prime Numbers

Prime Numbers

Prime Numbers

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

REFERENCES 565<br />

[Namba 1984] M. Namba. Geometry of Projective Algebraic Curves, volume 88 of<br />

Monographs and Textbooks in Pure and Applied Mathematics. Marcel<br />

Dekker, 1984.<br />

[Narkiewicz 1986] W. Narkiewicz. Classical Problems in Number Theory.<br />

PWN-Polish Scientific Publishers, 1986.<br />

[Nathanson 1996] M. Nathanson. Additive Number Theory: The Classical Bases,<br />

volume 164 of Graduate Texts in Mathematics. Springer–Verlag, 1996.<br />

[Nguyen 1998] P. Nguyen. A Montgomery-like square root for the number field<br />

sieve. In [Buhler 1998], pages 151–168.<br />

[Nguyen and Liu 1999] N. Nguyen and Q. Liu. The Regular Fourier Matrices and<br />

Nonuniform Fast Fourier Transforms. SIAM J. Sci. Comput., 21:283–293,<br />

1999.<br />

[Nicely 2004] T. Nicely. <strong>Prime</strong> constellations research project, 2004.<br />

http://www.trnicely.net/counts.html.<br />

[Niederreiter 1992] H. Niederreiter. Random Number Generation and<br />

Quasi-Monte-Carlo Methods, volume 63 of CBMS-NSF Regional<br />

Conference Series in Applied Mathematics. SIAM, 1992.<br />

[Niven et al. 1991] I. Niven, H. Zuckerman, and H. Montgomery. An Introduction<br />

to the Theory of <strong>Numbers</strong>. Fifth edition. John Wiley and Sons, 1991.<br />

[Nussbaumer 1981] H. Nussbaumer. Fast Fourier Transform and Convolution<br />

Algorithms. Springer–Verlag, 1981.<br />

[Odlyzko 1985] A. Odlyzko. Discrete logarithms in finite fields and their<br />

cryptographic significance. In Advances in Cryptology, Proc. Eurocrypt<br />

’84, volume 209 of Lecture Notes in Computer Science, pages 224–313.<br />

Springer–Verlag, 1985.<br />

[Odlyzko 1987] A. Odlyzko. On the distribution of spacings between zeros of the<br />

zeta function. Math. Comp., 48:273–308, 1987.<br />

[Odlyzko 1992] A. Odlyzko. The 10 20 -th zero of the Riemann zeta function and<br />

175 million of its neighbors, 1992. http://www.research.att.com/˜amo.<br />

[Odlyzko 1994] A. Odlyzko. Analytic computations in number theory. In<br />

W. Gautschi, editor, Mathematics of Computation 1943–1993, volume 48<br />

of Proc. Sympos. Appl. Math., pages 441–463. Amer. Math. Soc., 1994.<br />

[Odlyzko 2000] A. Odlyzko. Discrete logarithms: The past and the future.<br />

Designs, Codes, and Cryptography, 19:129–145, 2000.<br />

[Odlyzko 2005] A. Odlyzko. The zeros of the Riemann zeta function: the 10 22 -nd<br />

zero and 10 billion of its neighbors. In preparation.<br />

[Odlyzko and te Riele 1985] A. Odlyzko and H. te Riele. Disproof of the Mertens<br />

conjecture. J. Reine Angew. Math., 357:138–160, 1985.<br />

[Odlyzko and Schönhage 1988] A. Odlyzko and A. Schönhage. Fast algorithms for<br />

multiple evaluations of the Riemann zeta-function. Trans. Amer. Math.<br />

Soc., 309:797–809, 1988.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!