Prime Numbers

REFERENCES 557
[Feynman 1985] R. Feynman. Quantum mechanical computers. Optics News,
II:11–20, 1985.
[Flajolet and Odlyzko 1990] P. Flajolet and A. Odlyzko. Random mapping
statistics. In Advances in cryptology, Eurocrypt ’89, volume 434 of
Lecture Notes in Comput. Sci., pages 329–354, Springer—Verlag, 1990.
[Flajolet and Vardi 1996] P. Flajolet and I. Vardi. Zeta Function Expansions of
Classical Constants, 1996.
http://pauillac.inria.fr/algo/flajolet/Publications/Landau.ps.
[Forbes 1999] T. Forbes. Prime k-tuplets, 1999.
http://www.ltkz.demon.co.uk/ktuplets.htm.
[Ford 2002] K. Ford. Vinogradov’s integral and bounds for the Riemann zeta
function. Proc. London Math. Soc. (3), 85:565–633, 2002.
[Fouvry 1985] E. Fouvry. Théorème de Brun–Titchmarsh: application au théorème
de Fermat. Invent. Math., 79:383–407, 1985.
[Fraser 1976] D. Fraser. Array permutation by index-digit permutation. J. ACM,
23:298–309, 1976.
[Franke et al. 2004] J. Franke, T. Kleinjung, F. Morain, and T. Wirth. Proving the
primality of very large numbers with fastECPP. In Algorithmic number
theory: Proc. ANTS VI, Burlington, VT, volume 3076 of Lecture Notes in
Computer Science, pages 194–207. Springer-Verlag, 2004.
[Friedlander and Iwaniec 1998] J. Friedlander and H. Iwaniec. The polynomial
X 2 + Y 4 captures its primes. Ann. of Math., 148:945–1040, 1998.
[Friedlander et al. 2001] J. Friedlander, C. Pomerance, and I. Shparlinski. Period
of the power generator and small values of Carmichael’s function. Math.
Comp. 70:1591–1605, 2001.
[Frind et al. 2004] M. Frind, P. Jobling, and P. Underwood. 23 primes in
arithmetic progression. http://primes.plentyoffish.com.
[Furry 1942] W. Furry. Number of primes and probability considerations. Nature,
150:120–121, 1942.
[Gabcke 1979] W. Gabcke. Neue Herleitung und explizite Restabschätzung der
Riemann–Siegel Formel. PhD thesis, Georg-August-Universität zu
Göttingen, 1979.
[Gallot 1999] Y. Gallot, 1999. Private communication.
[Galway 1998] W. Galway, 1998. Private communication.
[Galway 2000] W. Galway. Analytic computation of the prime-counting function.
PhD thesis, U. Illinois at Urbana-Champaign, 2000.
[Gardner 1977] M. Gardner. Mathematical games: a new kind of cipher that would
take millions of years to break. Scientific American, August 1977.
[Gentleman and Sande 1966] W. Gentleman and G. Sande. Fast Fourier
transforms—for fun and profit. In Proc. AFIPS, volume 29, pages
563–578, 1966.