Skip to main content
\( \newcommand{\lt}{ < } \newcommand{\gt}{ > } \newcommand{\amp}{ & } \)

AppendixCReferences and Further Resources

There are so many resources I used in preparation of this book it would be very hard to list all of them. Still, I have a lot of recommendations for further reading, places for instructors to look for alternate examples, proofs, exercises, etc., and most of these are books I have actively used at some point. I attempted to include a canonical website for each book, though be aware that especially publisher pages may change at short notice. I've also included some valuable articles I have benefited from.

SectionC.1General References

There are many good introductory number theory texts.

[1]
  
Gareth A. and J. Mary Jones, Elementary Number Theory, Springer, London, (2005). (Website)
Note
[2]
  
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, fifth edition, Oxford, (1979) (Website for expanded sixth edition)
Note
[3]
  
William Stein, Elementary Number Theory: Primes, Congruences, and Secrets, Springer, (2008) (Website)
Note
[4]
  
Ken Rosen, Elementary Number Theory and its Applications, Pearson, (2011). (Website)
Note
[5]
  
David C. Marshall, Edward Odell, Michael Starbird, Number Theory through Inquiry, Mathematical Association of America, Washington, (2007). (Website)
Note
[6]
  
R. P. Burn, A pathway into number theory, Cambridge, (1996) (Website)
Note
[7]
  
John Stillwell, Elements of Number Theory, Springer, (2003) (Website)
Note
[8]
  
Harold Shapiro, Introduction to the Theory of Numbers, Dover, (2008) (No website)
Note
[9]
  
Anthony Gioia, The Theory of Numbers, Dover, (2001) (No website)
Note
[10]
  
Marty Erickson, Anthony Vazzana, David Garth, Introduction to Number Theory, second edition, CRC, (2016). (Website)
Note
[11]
  
George Andrews, Number Theory, Dover, (1994) (Website)
Note
[12]
  
H. M. Edwards, Higher Arithmetic: An Algorithmic Introduction to Number Theory, American Mathematical Society, (2006) (Website)
Note
[13]
  
Neville Robbins, Beginning Number Theory, Jones and Bartlett, (2006) (No website)
Note
[14]
  
Oystein Ore, Invitation to Number Theory, Mathematical Association of America, (1967) (Website)
Note

SectionC.2Proof and Programming References

The first few books here are good resources for an introduction to proof, which should cover anything needed as a prerequisite for this text.

In addition to the many good programming exercises in several books in the General References, the latter books will give you an introduction to the programming side of things.

[1]
  
Richard Hammack, The Book of Proof, (2013). (Website)
Note
[2]
  
Joseph Fields, A Gentle Introduction to the Art of Mathematics, (2013). (Website)
Note
[3]
  
Edward Burger, Extending the Frontiers of Mathematics, Key College, (2007) (Website)
Note
[4]
  
Gregory Bard, Sage for Undergraduates, American Mathematical Society, (2015) (Website)
Note
[5]
  
Craig Finch, Sage: Beginner's Guide, Packt, (2011) (Website)
Note
[6]
  
Allen Downey, Think Python, O'Reilly, (2012) (Website)
Note
[7]
  
Zed Shaw, Learn Python the Hard Way, Addison-Wesley, (2013) (Website)
Note

SectionC.3Specialized References

Number Theory is a huge field, and even at an introductory level there are many wonderful resources to be aware of. I have used most of the following in one way or another in preparation of this text, and if you are intrigued by a specific facet of number theory, I encourage you to get these from your library! Most of these are more specialized, but a few are not really texts but intended for the “casual” reader.

[1]
  
John Derbyshire, Prime Obsession, Joseph Henry Press, (2003) (Website)
Note
[2]
  
Roland van der Veen and Jan van de Craats, The Riemann Hypothesis, Mathematical Association of America, (2016). (Website)
Note
[3]
  
Barry Mazur and William Stein, Prime Numbers and the Riemann Hypothesis, Cambridge University Press, (2016). (Website)
Note
[4]
  
H. M. Edwards, Riemann's Zeta Function, Dover, (2001) (Website)
Note
[5]
  
Jeffrey Stopple, A Primer of Analytic Number Theory, Cambridge, (2003). (Website)
Note
[6]
  
Tom Apostol, Introduction to Analytic Number Theory, Springer, (1976). (Website)
Note
[7]
  
Stan Wagon and David Bressoud, A Course in Computational Number Theory, Wiley, (2008). (Website)
Note
[8]
  
Paul Pollack, Not Always Buried Deep, American Mathematical Society, (2009). (Website)
Note
[9]
  
Harold Davenport, The Higher Arithmetic, Cambridge University Press, (2008). (Website)
Note
[10]
  
Stephen Richards, A Number for Your Thoughts, S. P. Richards, (1982) (No website)
Note
[11]
  
Samuel S. Wagstaff, Jr., The Joy of Factoring, American Mathematical Society, (2013). (Website)
Note
[12]
  
George Andrews and Kimmo Eriksson, Integer Partitions, Cambridge University Press, (2004). (Website)
Note
[13]
  
Richard Friedberg, An Adventurer's Guide to Number Theory, Dover, (1995) (Website)
Note
[14]
  
Julian Havil, Gamma: Exploring Euler's Constant, Princeton, (2009). (Website)
Note
[15]
  
C. D. Olds, Anneli Lax, Giuliana Davidoff, The Geometry of Numbers, Mathematical Association of America, (2000) (Website)
Note
[16]
  
Paulo Ribenboim, The Little Book of Bigger Primes, Springer, (2004) (Website)
Note
[17]
  
Paulo Ribenboim, My Numbers, My Friends, Springer, (2000) (Website)
Note

SectionC.4Historical References

Number Theory is also a very old field, as should be clear from using this book. Here I have collated references intended both for mathematicians and the fabled ‘educated laity’. (Note that many of the other books referenced here have significant historical content, notably [C.3.5].)

[1]
  
Jim Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, (2005) (Website)
Note
[2]
  
John J. Watkins, Number Theory: A Historical Approach, Princeton, (2013). (Website)
Note
[3]
  
Oystein Ore, Number Theory and Its History, Dover, (1948). (Website)
Note
[4]
  
Jay Goldman, The Queen of Mathematics, AK Peters, (1997) (Website)
Note
[5]
  
William Dunham, Journey Through Genius, Wiley, (1990). (Website)
Note
[6]
  
William Dunham, Euler: The Master of Us All, Mathematical Association of America, (1999). (Website)
Note
[7]
  
A. Knoebel et al., Mathematical Masterpieces: Further Chronicles by the Explorers, Springer, (2007). (Website)
Note

SectionC.5Other References

Some books are just interesting, even if they are not primarily about number theory. I enjoyed all of these a great deal and recommend them.

[1]
  
Richard Evans Schwartz, You Can Count on Monsters, A K Peters, (2010) (Website)
Note
[2]
  
Nathan Carter, Visual Group Theory, Mathematical Association of America, (2009). (Website)
Note
[3]
  
John H. Conway and Richard Guy, The Book of Numbers, Springer, (1996). (Website)
Note
[4]
  
Arthur T. Benjamin and Ezra Brown (eds.), Biscuits of Number Theory, Mathematical Association of America, (2009). (Website)
Note
[5]
  
Kerins et al., Famous Functions in Number Theory, American Mathematical Society, (2015). (Website)
Note
[6]
  
Kerins et al., Applications of Algebra and Geometry to the Work of Teaching, American Mathematical Society, (2015). (Website)
Note
[7]
  
T. S. Michael, How to Guard an Art Gallery, Johns Hopkins, (2009) (Website)
Note
[8]
  
Robert Young, Excursions in Calculus: An Interplay of the Continuous and Discrete, Mathematical Association of America, (1992) (Website)
Note

SectionC.6Useful Articles

Throughout the text, I've attempted to reference articles in so-called ‘generalist’ mathematics publications which have been useful or intriguing. See also the collection [C.5.4], where some of these appear. For any comments, see the locations they are referenced.

[1]
  
Ivan Niven and Barry Powell, Primes in Certain Arithmetic Progressions, The American Mathematical Monthly, June-July 1976, 83 no. 6, 467–469.
[2]
  
D. Zagier, A One-Sentence Proof That Every Prime \(p\equiv 1 (\text{mod }4)\) Is a Sum of Two Squares, The American Mathematical Monthly, February 1990, 97 no. 2, 144–144.
[3]
  
Andrew Granville and Greg Martin, Prime Number Races, The American Mathematical Monthly, January 2006, 113 no. 1, 1–33.
[4]
  
David A. Cox, Why Eisenstein Proved the Eisenstein Criterion and Why Schönemann Discovered It First, The American Mathematical Monthly, January 2011, 118 no. 1, 3–21.
[5]
  
Steven H. Weintraub, On Legendre’s Work on the Law of Quadratic Reciprocity, The American Mathematical Monthly, March 2011, 118 no. 3, 210–216.
[6]
  
Jonathan Bayless and Dominic Klyve, Reciprocal Sums as a Knowledge Metric: Theory, Computation, and Perfect Numbers, The American Mathematical Monthly, November 2013, 120 no. 9, 822–831.
[7]
  
Xianzu Lin, Infinitely Many Primes in the Arithmetic Progression \(kn-1\), The American Mathematical Monthly, January 2015, 122 no. 1, 48–51.
[8]
  
Reinhard Laubenbacher and David Pengelley, Eisenstein's Misunderstood Geometric Proof of the Quadratic Reciprocity Theorem, The College Mathematics Journal, January 1994, 25 no. 1, 29–34.
[9]
  
Roger B. Nelsen, Proof Without Words: Square Triangular Numbers and Almost Isosceles Pythagorean Triples, College Mathematics Journal, May 2016, 47 no. 3, 179–179.
[10]
  
David Lowry-Duda, Unexpected Conjectures about -5 Modulo Primes, College Mathematics Journal, January 2015, 46 no. 1, 56–57.
[11]
  
William G. Stanton and Judy A. Holdener, Abundancy “Outlaws” of the Form \(\frac{\sigma(N)+t}{N}\), Journal of Integer Sequences, 10
[12]
  
D. R. Slavitt, Give Way To God, or The Dying Christ – Pierre de Fermat, The Mathematical Intelligencer, Summer 2012, 34 no. 2, 3–5.
[13]
  
Paul Nahin, The Mysterious Mr. Graham, The Mathematical Intelligencer, Spring 2016, 38 no. 1, 48–51.
[14]
  
P. A. Weiner, The abundancy index, a measure of perfection, Mathematics Magazine, October 2000, 73 no. 4, 307–310.
[15]
  
Andrew Bremner, Positively prodigious powers or how Dudeney done it?, Mathematics Magazine, April 2011, 84 no. 2, 120–125.
[16]
  
Rafael Jakimczuk, The Quadratic Character of 2, Mathematics Magazine, April 2011, 84 no. 2, 126–127.
[17]
  
Russell A. Gordon, Properties of Eisenstein Triples, Mathematics Magazine, February 2012, 85 no. 1, 12–25.
[18]
  
Roger B. Nelsen, Proof Without Words: Infinitely Many Almost-Isosceles Pythagorean Triples Exist, Mathematics Magazine, April 2016, 89 no. 2, 103–104.
[19]
  
C. Edward Sandifer, How Euler Did It: Odd Perfect Numbers, MAA Online, November 2006
[20]
  
Matthias Beck, How to change coins, M&M's, or chicken nuggets: The linear Diophantine problem of Frobenius, in Resources for Teaching Discrete Mathematics: Classroom Projects, History Modules, and Articles (B. Hopkins, ed.), Mathematical Association of America, 2009, 65–74.