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.

556 REFERENCES<br />

[Dudon 1987] J. Dudon. The golden scale. Pitch, I/2:1–7, 1987.<br />

[Dutt and Rokhlin 1993] A. Dutt and V. Rokhlin. Fast Fourier Transforms for<br />

Nonequispaced Data. SIAM J. Sci. Comput. 14:1368–1393, 1993.<br />

[Edwards 1974] H. Edwards. Riemann’s Zeta Function. Academic Press, 1974.<br />

[Ekert and Jozsa 1996] A. Ekert and R Jozsa. Quantum computation and Shor’s<br />

factoring algorithm. Rev. Mod. Phys., 68:733–753, 1996.<br />

[Elkenbracht-Huizing 1997] M. Elkenbracht-Huizing. Factoring integers with the<br />

Number Field Sieve. PhD thesis, University of Leiden, 1997.<br />

[Elkies 1991] N. Elkies. Explicit isogenies. Unpublished manuscript, 1991.<br />

[Elkies 1997] N. Elkies. Elliptic and modular curves over finite fields and related<br />

computational issues. In J. Teitelbaum, editor, Computational<br />

Perspectives on Number Theory (Chicago, IL, 1995), volume 7 of<br />

AMS/IP Stud. Adv. Math., pages 21–76. Atkin Conference, Amer. Math.<br />

Soc., 1998.<br />

[Ellison and Ellison 1985] W. Ellison and F. Ellison. <strong>Prime</strong> <strong>Numbers</strong>. John Wiley<br />

and Sons, 1985.<br />

[Engelsma 2004 1999] T. Engelsma. Website for k-tuple permissible patterns,<br />

2004. http://www.opertech.com/primes/k-tuples.html.<br />

[Erdős 1948] P. Erdős. On arithmetical properties of Lambert series. J. Indian<br />

Math. Soc. (N.S.), 12:63–66, 1948.<br />

[Erdős 1950] P. Erdős. On almost primes. Amer. Math. Monthly, 57:404–407, 1950.<br />

[Erdős and Pomerance 1986] P. Erdős and C. Pomerance. On the number of false<br />

witnesses for a composite number. Math. Comp., 46:259–279, 1986.<br />

[Erdős et al. 1988] P. Erdős, P. Kiss, and A. Sárközy. A lower bound for the<br />

counting function of Lucas pseudoprimes. Math. Comp., 51:315–323, 1988.<br />

[Escott et al. 1998] A. Escott, J. Sager, A. Selkirk, and D. Tsapakidis. Attacking<br />

elliptic curve cryptosystems using the parallel Pollard rho method. RSA<br />

Cryptobytes, 4(2):15–19, 1998.<br />

[Estermann 1952] T. Estermann. Introduction to Modern <strong>Prime</strong> Number Theory.<br />

Cambridge University Press, 1952.<br />

[Faure 1981] H. Faure. Discrépances de suites associées à un système de<br />

numération (en dimension un). Bull. Soc, Math. France, 109:143–182,<br />

1981.<br />

[Faure 1982] H. Faure. Discrépances de suites associées à un système de<br />

numération (en dimension s). Acta Arith., 41:337–351, 1982.<br />

[Fessler and Sutton 2003] J. Fessler and B. Sutton. Nonuniform Fast Fourier<br />

Transforms Using Min-Max Interpolation. IEEE Trans. Sig. Proc.,<br />

51:560-574, 2003.<br />

[Feynman 1982] R. Feynman. Simulating physics with computers. Intl. J. Theor.<br />

Phys., 21(6/7):467–488, 1982.

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

Saved successfully!

Ooh no, something went wrong!