Number Theory Revealed: An Introduction acquaints undergraduates with the “Queen of Mathematics”. The text offers a fresh take on congruences, power residues, quadratic residues, primes, and Diophantine equations and presents hot topics like cryptography, factoring, and primality testing. Students are also introduced to beautiful enlightening questions like the structure of Pascal's triangle mod p p and modern twists on traditional questions like the values represented by binary quadratic forms and large solutions of equations. Each chapter includes an “elective appendix” with additional reading, projects, and references. An expanded edition, Number Theory Revealed: A Masterclass, offers a more comprehensive approach to these core topics and adds additional material in further chapters and appendices, allowing instructors to create an individualized course tailored to their own (and their students') interests.
Number Theory Revealed: A Masterclass acquaints enthusiastic students with the “Queen of Mathematics”. The text offers a fresh take on congruences, power residues, quadratic residues, primes, and Diophantine equations and presents hot topics like cryptography, factoring, and primality testing. Students are also introduced to beautiful enlightening questions like the structure of Pascal's triangle mod $p$ and modern twists on traditional questions like the values represented by binary quadratic forms, the anatomy of integers, and elliptic curves. This Masterclass edition contains many additional chapters and appendices not found in Number Theory Revealed: An Introduction, highlighting beautiful developments and inspiring other subjects in mathematics (like algebra). This allows instructors to tailor a course suited to their own (and their students') interests. There are new yet accessible topics like the curvature of circles in a tiling of a circle by circles, the latest discoveries on gaps between primes, a new proof of Mordell's Theorem for congruent elliptic curves, and a discussion of the $abc$-conjecture including its proof for polynomials. About the Author: Andrew Granville is the Canada Research Chair in Number Theory at the University of Montreal and professor of mathematics at University College London. He has won several international writing prizes for exposition in mathematics, including the 2008 Chauvenet Prize and the 2019 Halmos-Ford Prize, and is the author of Prime Suspects (Princeton University Press, 2019), a beautifully illustrated graphic novel murder mystery that explores surprising connections between the anatomies of integers and of permutations.
"This book is the first volume of a two-volume textbook for undergraduates and is indeed the crystallization of a course offered by the author at the California Institute of Technology to undergraduates without any previous knowledge of number theory. For this reason, the book starts with the most elementary properties of the natural integers. Nevertheless, the text succeeds in presenting an enormous amount of material in little more than 300 pages."-—MATHEMATICAL REVIEWS
This introduction to algebraic number theory via the famous problem of "Fermats Last Theorem" follows its historical development, beginning with the work of Fermat and ending with Kummers theory of "ideal" factorization. The more elementary topics, such as Eulers proof of the impossibilty of x+y=z, are treated in an uncomplicated way, and new concepts and techniques are introduced only after having been motivated by specific problems. The book also covers in detail the application of Kummers theory to quadratic integers and relates this to Gauss'theory of binary quadratic forms, an interesting and important connection that is not explored in any other book.
This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this. Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs. The book contains over 360 exercises, including 230 with solutions and 130 more involved problems suitable for homework. There are also Investigate! activities throughout the text to support active, inquiry based learning. While there are many fine discrete math textbooks available, this text has the following advantages: It is written to be used in an inquiry rich course. It is written to be used in a course for future math teachers. It is open source, with low cost print editions and free electronic editions.
Accessible but rigorous, this outstanding text encompasses all of the topics covered by a typical course in elementary abstract algebra. Its easy-to-read treatment offers an intuitive approach, featuring informal discussions followed by thematically arranged exercises. This second edition features additional exercises to improve student familiarity with applications. 1990 edition.
The ultimate mathematics reference book This is a one-of-a-kind reference for anyone with a serious interest in mathematics. Edited by Timothy Gowers, a recipient of the Fields Medal, it presents nearly two hundred entries—written especially for this book by some of the world's leading mathematicians—that introduce basic mathematical tools and vocabulary; trace the development of modern mathematics; explain essential terms and concepts; examine core ideas in major areas of mathematics; describe the achievements of scores of famous mathematicians; explore the impact of mathematics on other disciplines such as biology, finance, and music—and much, much more. Unparalleled in its depth of coverage, The Princeton Companion to Mathematics surveys the most active and exciting branches of pure mathematics. Accessible in style, this is an indispensable resource for undergraduate and graduate students in mathematics as well as for researchers and scholars seeking to understand areas outside their specialties. Features nearly 200 entries, organized thematically and written by an international team of distinguished contributors Presents major ideas and branches of pure mathematics in a clear, accessible style Defines and explains important mathematical concepts, methods, theorems, and open problems Introduces the language of mathematics and the goals of mathematical research Covers number theory, algebra, analysis, geometry, logic, probability, and more Traces the history and development of modern mathematics Profiles more than ninety-five mathematicians who influenced those working today Explores the influence of mathematics on other disciplines Includes bibliographies, cross-references, and a comprehensive index Contributors include: Graham Allan, Noga Alon, George Andrews, Tom Archibald, Sir Michael Atiyah, David Aubin, Joan Bagaria, Keith Ball, June Barrow-Green, Alan Beardon, David D. Ben-Zvi, Vitaly Bergelson, Nicholas Bingham, Béla Bollobás, Henk Bos, Bodil Branner, Martin R. Bridson, John P. Burgess, Kevin Buzzard, Peter J. Cameron, Jean-Luc Chabert, Eugenia Cheng, Clifford C. Cocks, Alain Connes, Leo Corry, Wolfgang Coy, Tony Crilly, Serafina Cuomo, Mihalis Dafermos, Partha Dasgupta, Ingrid Daubechies, Joseph W. Dauben, John W. Dawson Jr., Francois de Gandt, Persi Diaconis, Jordan S. Ellenberg, Lawrence C. Evans, Florence Fasanelli, Anita Burdman Feferman, Solomon Feferman, Charles Fefferman, Della Fenster, José Ferreirós, David Fisher, Terry Gannon, A. Gardiner, Charles C. Gillispie, Oded Goldreich, Catherine Goldstein, Fernando Q. Gouvêa, Timothy Gowers, Andrew Granville, Ivor Grattan-Guinness, Jeremy Gray, Ben Green, Ian Grojnowski, Niccolò Guicciardini, Michael Harris, Ulf Hashagen, Nigel Higson, Andrew Hodges, F. E. A. Johnson, Mark Joshi, Kiran S. Kedlaya, Frank Kelly, Sergiu Klainerman, Jon Kleinberg, Israel Kleiner, Jacek Klinowski, Eberhard Knobloch, János Kollár, T. W. Körner, Michael Krivelevich, Peter D. Lax, Imre Leader, Jean-François Le Gall, W. B. R. Lickorish, Martin W. Liebeck, Jesper Lützen, Des MacHale, Alan L. Mackay, Shahn Majid, Lech Maligranda, David Marker, Jean Mawhin, Barry Mazur, Dusa McDuff, Colin McLarty, Bojan Mohar, Peter M. Neumann, Catherine Nolan, James Norris, Brian Osserman, Richard S. Palais, Marco Panza, Karen Hunger Parshall, Gabriel P. Paternain, Jeanne Peiffer, Carl Pomerance, Helmut Pulte, Bruce Reed, Michael C. Reed, Adrian Rice, Eleanor Robson, Igor Rodnianski, John Roe, Mark Ronan, Edward Sandifer, Tilman Sauer, Norbert Schappacher, Andrzej Schinzel, Erhard Scholz, Reinhard Siegmund-Schultze, Gordon Slade, David J. Spiegelhalter, Jacqueline Stedall, Arild Stubhaug, Madhu Sudan, Terence Tao, Jamie Tappenden, C. H. Taubes, Rüdiger Thiele, Burt Totaro, Lloyd N. Trefethen, Dirk van Dalen, Richard Weber, Dominic Welsh, Avi Wigderson, Herbert Wilf, David Wilkins, B. Yandell, Eric Zaslow, and Doron Zeilberger
This book is an introduction to the language and standard proof methods of mathematics. It is a bridge from the computational courses (such as calculus or differential equations) that students typically encounter in their first year of college to a more abstract outlook. It lays a foundation for more theoretical courses such as topology, analysis and abstract algebra. Although it may be more meaningful to the student who has had some calculus, there is really no prerequisite other than a measure of mathematical maturity.
This is a substantially revised and updated introduction to arithmetic topics, both ancient and modern, that have been at the centre of interest in applications of number theory, particularly in cryptography. As such, no background in algebra or number theory is assumed, and the book begins with a discussion of the basic number theory that is needed. The approach taken is algorithmic, emphasising estimates of the efficiency of the techniques that arise from the theory, and one special feature is the inclusion of recent applications of the theory of elliptic curves. Extensive exercises and careful answers are an integral part all of the chapters.
