Number theory Books

Book Synopsis20 years later The Music of the Primes is still a groundbreaking popular science book. This new edition features updates from the author and a foreword by actor and director, Simon McBurney. In 1859, the German mathematician Bernhard Riemann presented a paper to the Berlin Academy which would change the history of mathematics. The subject was the strange and enigmatic prime numbers. At the heart of the presentation was an idea, a hypothesis, that Riemann had not yet proved but which has come to obsess mathematicians for the last 150 years. No one knows if he ever found the proof; on his death his housekeeper burnt all the personal papers. Today, the hypothesis is considered by many the holy grail of mathematics but has significance far beyond maths. At the of the heart of the enigma is a prize much larger than just intellectual glory; not only is there a $1 million reward for the person who can crack it but also is the key to all banking and e-commerce security. It is the idea that brings together many other areas of science and has ramifications within Quantum Mechanics, Chaos Theory and the future of computing. In 'The Music of the Primes', one of Britain's leading mathematicians, Marcus du Sautoy, recounts the history of these elusive numbers. It is a story of eccentric and brilliant men, last minute escapes from death, strange journeys, dangerous ideas and the unquenchable thirst for knowledge that drove some men mad and others to unparalleled glory. du Sautoy also tells a coruscating history of Mathematics. Combining in-depth knowledge as a practitioner in the field with narrative flair, this book will become a classic of popular science writing and will rank alongside 'Chaos' and 'Fermat's Last Theorem' within the genre. The Riemann Hypothesis:• Compared to Fermat's Last Theorem, the Hypothesis is mathematicians’ real Holy Grail• Is the only problem from Hilbert's 1900 Centenary Problems that was unproved in the 20th century and now has a $1 million reward for the person who cracks it.• The Hypothesis is the key to all Internet and e-commerce securityTrade Review'Du Sautoy is a contagious enthusiast, a populist with a staunch faith in the public's intelligence…he has uncovered a wealth of intriguing anecdotes that he has woven into a compelling narrative.' Observer 'He laces the ideas with history, anecdote and personalia – an entertaining mix that renders an austere subject palatable…valiant and ingenious…Even those with a mathematical allergy can enjoy du Sautoy's depictions of his cast of characters' The Times 'He brings hugely enjoyable writing, full of zest and passion, to the most fundamental questions in the pursuit of true knowledge.' Sunday Times 'A mesmerising journey into the world of mathematics and its mysteries.' Daily Mail 'A brilliant storyteller.' Independent

Read more less

Book SynopsisHow do you remember more and forget less?How can you earn more and become more creative just by moving house?And how do you pack a car boot most efficiently?This is your shortcut to the art of the shortcut.Mathematics is full of better ways of thinking, and with over 2,000 years of knowledge to draw on, Oxford mathematician Marcus du Sautoy interrogates his passion for shortcuts in this fresh and fascinating guide. After all, shortcuts have enabled so much of human progress, whether in constructing the first cities around the Euphrates 5,000 years ago, using calculus to determine the scale of the universe or in writing today's algorithms that help us find a new life partner.As well as looking at the most useful shortcuts in history such as measuring the circumference of the earth in 240 BC to diagrams that illustrate how modern GPS works Marcus also looks at how you can use shortcuts in investing or how to learn a musical instrument to memory techniques. He talks to, among many, the Trade Review‘enjoyably clever …with vividly illustrated chapters about the real-world applications of algebra, geometry, probability theory…It’s Du Sautoy, in the end, who provides the wisest commentary’ Steven Poole, Guardian ‘If you thought Maths was all about long stuff, like long division and long multiplication and taking a long, long time to figure things out, Marcus du Sautoy shows that it's just the opposite. Full of humour, stories and the lightest of touches, this is a sight-seeing tour of some of the world's greatest neat dodges, unexpected turns and useful cut-throughs. Prepare to be caught short’ Michael Rosen ‘This book will change the way you look at the world. It's chock full of stories, ideas and clever tricks – I loved it. Marcus is a maestro at making big ideas come alive – he deserves his place alongside Richard Dawkins, E. O. Wilson and Carlo Rovelli in the pantheon of great modern science writers’ Rohan Silva, CEO and founder of Second Home ‘If mathematics has proved anything, it is that shortcuts can change the world. Marcus du Sautoy has come up with a smart, well written and entertaining guide to the connecting tunnels, underpasses and other tricks to traverse the trials of everyday life’ Roger Highfield, author, broadcaster and Science Director at the Science Museum ‘The joy of du Sautoy’s book isn’t really the art of the real-world shortcut at all. It is the romp through mathematical ideas, from place value to non Euclidean geometry to probability theory…There are vivid historical examples of scientists and others using mathematical ideas to solve problems’ Tim Harford, Financial Times

Read more less

Book SynopsisElliptic Tales describes the latest developments in number theory by looking at one of the most exciting unsolved problems in contemporary mathematics--the Birch and Swinnerton-Dyer Conjecture. In this book, Avner Ash and Robert Gross guide readers through the mathematics they need to understand this captivating problem. The key to the conjectureTrade Review"The authors present their discussion in an informal, sometimes playful manner and with detail that will appeal to an audience with a basic understanding of calculus. This book will captivate math enthusiasts as well as readers curious about an intriguing and still unanswered question."--Margaret Dominy, Library Journal "Minimal prerequisites and its clear writing make this book (which even has a few exercises) a great choice for a seminar for mathematics majors, who at some point should have such an excursion to one of the frontiers of mathematics."--Mathematics Magazine "The authors of Elliptic Tales do a superb job in demonstrating the approach that mathematicians take when they confront unsolved problems involving elliptic curves."--Sungkon Chang, Times Higher Education "One cannot help being impressed, in reading the book and pursuing a few of the references, by the magnitude of the enterprise it chronicles."--James Case, SIAM News "Ash and Gross thoroughly explain the statement and significance of the linchpin Birch and Swinnerton-Dyer conjection... [A]sh and Gross deliver ample and current intellectual and technical substance."--Choice "I would envision this book as an excellent text for an undergraduate 'capstone' course in mathematics; the book lends itself to independent reading, but topics may be explored in much greater depth and rigor in the classroom. Additionally, the book indeed brings together ideas from calculus, complex variables and algebra, showing how a single mathematical research question may require an integrated understanding of the various branches of mathematics. Thus, it encourages students to reinforce their understanding of these various fields, while simultaneously introducing them to an open question in mathematics and a vibrant field of study."--Lisa A. Berger, Mathematical Reviews Clippings "The book is very pleasantly written, and in my opinion, the authors have done an admirable job in giving an idea to non-experts what the Birch-Swinnerton Dyer conjecture is about."--Jan-Hendrik Evertse, Zentralblatt MATH "The book's most important contributions ... are the sense of discovery, invention, and insight into the habits of mind used by mathematicians on this journey. I would recommend this book to anyone who wants to be challenged mathematically or who wants to experience mathematics as creative and exciting."--Jacqueline Coomes, Mathematics Teacher "[T]his book is a wonderful introduction to what is arguably one of the most important mathematical problems of our time and for that reason alone it deserves to be widely read. Another reason to recommend this book is the opportunity to share in the readily apparent joy the authors have for their subject and the beauty they see in it, not least because ... joy and beauty are the most important reasons for doing mathematics, irrespective of its dollar value."--Rob Ashmore, Mathematics Today "This book has many nice aspects. Ash and Gross give a truly stimulating introduction to elliptic curves and the BSD conjecture for undergraduate students. The main achievement is to make a relative easy exposition of these so technical topics."--Jonathan Sanchez-Hernandez, Mathematical SocietyTable of ContentsPreface xiii Acknowledgments xix Prologue 1 PART I. DEGREE Chapter 1. Degree of a Curve 13 1.Greek Mathematics 13 2.Degree 14 3.Parametric Equations 20 4.Our Two Definitions of Degree Clash 23 Chapter 2. Algebraic Closures 26 1.Square Roots of Minus One 26 2.Complex Arithmetic 28 3.Rings and Fields 30 4.Complex Numbers and Solving Equations 32 5.Congruences 34 6.Arithmetic Modulo a Prime 38 7.Algebraic Closure 38 Chapter 3. The Projective Plane 42 1.Points at Infinity 42 2.Projective Coordinates on a Line 46 3.Projective Coordinates on a Plane 50 4.Algebraic Curves and Points at Infinity 54 5.Homogenization of Projective Curves 56 6.Coordinate Patches 61 Chapter 4. Multiplicities and Degree 67 1.Curves as Varieties 67 2.Multiplicities 69 3.Intersection Multiplicities 72 4.Calculus for Dummies 76 Chapter 5. B'ezout's Theorem 82 1.A Sketch of the Proof 82 2.An Illuminating Example 88 PART II. ELLIPTIC CURVES AND ALGEBRA Chapter 6. Transition to Elliptic Curves 95 Chapter 7. Abelian Groups 100 1.How Big Is Infinity? 100 2.What Is an Abelian Group? 101 3.Generations 103 4.Torsion 106 5.Pulling Rank 108 Appendix: An Interesting Example of Rank and Torsion 110 Chapter 8. Nonsingular Cubic Equations 116 1.The Group Law 116 2.Transformations 119 3.The Discriminant 121 4.Algebraic Details of the Group Law 122 5.Numerical Examples 125 6.Topology 127 7.Other Important Facts about Elliptic Curves 131 5.Two Numerical Examples 133 Chapter 9. Singular Cubics 135 1.The Singular Point and the Group Law 135 2.The Coordinates of the Singular Point 136 3.Additive Reduction 137 4.Split Multiplicative Reduction 139 5.Nonsplit Multiplicative Reduction 141 6.Counting Points 145 7.Conclusion 146 Appendix A: Changing the Coordinates of the Singular Point 146 Appendix B: Additive Reduction in Detail 147 Appendix C: Split Multiplicative Reduction in Detail 149 Appendix D: Nonsplit Multiplicative Reduction in Detail 150 Chapter 10. Elliptic Curves over Q 152 1.The Basic Structure of the Group 152 2.Torsion Points 153 3.Points of Infinite Order 155 4.Examples 156 PART III. ELLIPTIC CURVES AND ANALYSIS Chapter 11. Building Functions 161 1.Generating Functions 161 2.Dirichlet Series 167 3.The Riemann Zeta-Function 169 4.Functional Equations 171 5.Euler Products 174 6.Build Your Own Zeta-Function 176 Chapter 12. Analytic Continuation 181 1.A Difference that Makes a Difference 181 2.Taylor Made 185 3.Analytic Functions 187 4.Analytic Continuation 192 5.Zeroes, Poles, and the Leading Coefficient 196 Chapter 13. L-functions 199 1.A Fertile Idea 199 2.The Hasse-Weil Zeta-Function 200 3.The L-Function of a Curve 205 4.The L-Function of an Elliptic Curve 207 5.Other L-Functions 212 Chapter 14. Surprising Properties of L-functions 215 1.Compare and Contrast 215 2.Analytic Continuation 220 3.Functional Equation 221 Chapter 15. The Conjecture of Birch and Swinnerton-Dyer 225 1.How Big Is Big? 225 2.Influences of the Rank on the Np's 228 3.How Small Is Zero? 232 4.The BSD Conjecture 236 5.Computational Evidence for BSD 238 6.The Congruent Number Problem 240 Epilogue 245 Retrospect 245 Where DoWe Go from Here? 247 Bibliography 249 Index 251

Read more less

Book SynopsisWritten by a distinguished mathematician and teacher, this undergraduate text uses a combinatorial approach to accommodate both math majors and liberal arts students. In addition to covering the basics of number theory, it offers an outstanding introduction to partitions, plus chapters on multiplicativity-divisibility, quadratic congruences, additivity, and more.

Read more less

Book SynopsisIn the title, "[the square root of minus one]" appears as a radical over "-1."Trade ReviewOne of Choice's Outstanding Academic Titles for 1999 Honorable Mention for the 1998 Award for Best Professional/Scholarly Book in Mathematics, Association of American Publishers "A book-length hymn of praise to the square root of minus one."--Brian Rotman, Times Literary Supplement "An Imaginary Tale is marvelous reading and hard to put down. Readers will find that Nahin has cleared up many of the mysteries surrounding the use of complex numbers."--Victor J. Katz, Science "[An Imaginary Tale] can be read for fun and profit by anyone who has taken courses in introductory calculus, plane geometry and trigonometry."--William Thompson, American Scientist "Someone has finally delivered a definitive history of this 'imaginary' number... A must read for anyone interested in mathematics and its history."--D. S. Larson, Choice "Attempting to explain imaginary numbers to a non-mathematician can be a frustrating experience... On such occasions, it would be most useful to have a copy of Paul Nahin's excellent book at hand."--A. Rice, Mathematical Gazette "Imaginary numbers! Threeve! Ninety-fifteen! No, not those kind of imaginary numbers. If you have any interest in where the concept of imaginary numbers comes from, you will be drawn into the wonderful stories of how i was discovered."--Rebecca Russ, Math Horizons "There will be something of reward in this book for everyone."--R.G. Keesing, Contemporary Physics "Nahin has given us a fine addition to the family of books about particular numbers. It is interesting to speculate what the next member of the family will be about. Zero? The Euler constant? The square root of two? While we are waiting, we can enjoy An Imaginary Tale."--Ed Sandifer, MAA Online "Paul Nahin's book is a delightful romp through the development of imaginary numbers."--Robin J. Wilson, London Mathematical Society Newsletter "You will definitely enjoy it. In fact it clearly reflects the the joy and delight that the author experienced when he was confronted with complex analysis during his engineering studies."--Adhemar Bultheel, European Mathematical SocietyTable of Contents*FrontMatter, pg. i*A Note to the Reader, pg. vii*Contents, pg. ix*Illustrations, pg. xi*Preface to the Paperback Edition, pg. xiii*Preface, pg. xxi*Introduction, pg. 1*CHAPTER ONE The Puzzles of Imaginary Numbers, pg. 8*CHAPTER TWO. A First Try at Understanding the Geometry of -1, pg. 31*CHAPTER THREE. The Puzzles Start to Clear, pg. 48*CHAPTER FOUR. Using Complex Numbers, pg. 84*CHAPTER FIVE. More Uses of Complex Numbers, pg. 105*CHAPTER SIX. Wizard Mathematics, pg. 142*CHAPTER SEVEN. The Nineteenth Century, Cauchy, and the Beginning of Complex Function Theory, pg. 187*APPENDIX A. The Fundamental Theorem of Algebra, pg. 227*APPENDIX B. The Complex Roots of a Transcendental Equation, pg. 230*APPENDIX C. ( -1)( -1) to 135 Decimal Places, and How It Was Computed, pg. 235*APPENDIX D. Solving Clausen's Puzzle, pg. 238*APPENDIX E. Deriving the Differential Equation for the Phase-Shift Oscillator, pg. 240*APPENDIX F. The Value of the Gamma Function on the Critical Line, pg. 244*Notes, pg. 247*Name Index, pg. 261*Subject Index, pg. 265*Acknowledgments, pg. 269

Read more less

Book SynopsisDescribes the developments in number theory by looking at one of the most exciting unsolved problems in contemporary mathematics - the Birch and Swinnerton-Dyer Conjecture. The Clay Mathematics Institute is offering a prize of $1 million to anyone who can discover a general solution to the problem.Trade Review"The authors present their discussion in an informal, sometimes playful manner and with detail that will appeal to an audience with a basic understanding of calculus. This book will captivate math enthusiasts as well as readers curious about an intriguing and still unanswered question."--Margaret Dominy, Library Journal "Minimal prerequisites and its clear writing make this book (which even has a few exercises) a great choice for a seminar for mathematics majors, who at some point should have such an excursion to one of the frontiers of mathematics."--Mathematics Magazine "The authors of Elliptic Tales do a superb job in demonstrating the approach that mathematicians take when they confront unsolved problems involving elliptic curves."--Sungkon Chang, Times Higher Education "One cannot help being impressed, in reading the book and pursuing a few of the references, by the magnitude of the enterprise it chronicles."--James Case, SIAM News "Ash and Gross thoroughly explain the statement and significance of the linchpin Birch and Swinnerton-Dyer conjection... [A]sh and Gross deliver ample and current intellectual and technical substance."--Choice "I would envision this book as an excellent text for an undergraduate 'capstone' course in mathematics; the book lends itself to independent reading, but topics may be explored in much greater depth and rigor in the classroom. Additionally, the book indeed brings together ideas from calculus, complex variables and algebra, showing how a single mathematical research question may require an integrated understanding of the various branches of mathematics. Thus, it encourages students to reinforce their understanding of these various fields, while simultaneously introducing them to an open question in mathematics and a vibrant field of study."--Lisa A. Berger, Mathematical Reviews Clippings "The book is very pleasantly written, and in my opinion, the authors have done an admirable job in giving an idea to non-experts what the Birch-Swinnerton Dyer conjecture is about."--Jan-Hendrik Evertse, Zentralblatt MATH "The book's most important contributions ... are the sense of discovery, invention, and insight into the habits of mind used by mathematicians on this journey. I would recommend this book to anyone who wants to be challenged mathematically or who wants to experience mathematics as creative and exciting."--Jacqueline Coomes, Mathematics Teacher "[T]his book is a wonderful introduction to what is arguably one of the most important mathematical problems of our time and for that reason alone it deserves to be widely read. Another reason to recommend this book is the opportunity to share in the readily apparent joy the authors have for their subject and the beauty they see in it, not least because ... joy and beauty are the most important reasons for doing mathematics, irrespective of its dollar value."--Rob Ashmore, Mathematics Today "This book has many nice aspects. Ash and Gross give a truly stimulating introduction to elliptic curves and the BSD conjecture for undergraduate students. The main achievement is to make a relative easy exposition of these so technical topics."--Jonathan Sanchez-Hernandez, Mathematical SocietyTable of ContentsPreface xiii Acknowledgments xix Prologue 1 PART I. DEGREE Chapter 1. Degree of a Curve 13 1.Greek Mathematics 13 2.Degree 14 3.Parametric Equations 20 4.Our Two Definitions of Degree Clash 23 Chapter 2. Algebraic Closures 26 1.Square Roots of Minus One 26 2.Complex Arithmetic 28 3.Rings and Fields 30 4.Complex Numbers and Solving Equations 32 5.Congruences 34 6.Arithmetic Modulo a Prime 38 7.Algebraic Closure 38 Chapter 3. The Projective Plane 42 1.Points at Infinity 42 2.Projective Coordinates on a Line 46 3.Projective Coordinates on a Plane 50 4.Algebraic Curves and Points at Infinity 54 5.Homogenization of Projective Curves 56 6.Coordinate Patches 61 Chapter 4. Multiplicities and Degree 67 1.Curves as Varieties 67 2.Multiplicities 69 3.Intersection Multiplicities 72 4.Calculus for Dummies 76 Chapter 5. B'ezout's Theorem 82 1.A Sketch of the Proof 82 2.An Illuminating Example 88 PART II. ELLIPTIC CURVES AND ALGEBRA Chapter 6. Transition to Elliptic Curves 95 Chapter 7. Abelian Groups 100 1.How Big Is Infinity? 100 2.What Is an Abelian Group? 101 3.Generations 103 4.Torsion 106 5.Pulling Rank 108 Appendix: An Interesting Example of Rank and Torsion 110 Chapter 8. Nonsingular Cubic Equations 116 1.The Group Law 116 2.Transformations 119 3.The Discriminant 121 4.Algebraic Details of the Group Law 122 5.Numerical Examples 125 6.Topology 127 7.Other Important Facts about Elliptic Curves 131 5.Two Numerical Examples 133 Chapter 9. Singular Cubics 135 1.The Singular Point and the Group Law 135 2.The Coordinates of the Singular Point 136 3.Additive Reduction 137 4.Split Multiplicative Reduction 139 5.Nonsplit Multiplicative Reduction 141 6.Counting Points 145 7.Conclusion 146 Appendix A: Changing the Coordinates of the Singular Point 146 Appendix B: Additive Reduction in Detail 147 Appendix C: Split Multiplicative Reduction in Detail 149 Appendix D: Nonsplit Multiplicative Reduction in Detail 150 Chapter 10. Elliptic Curves over Q 152 1.The Basic Structure of the Group 152 2.Torsion Points 153 3.Points of Infinite Order 155 4.Examples 156 PART III. ELLIPTIC CURVES AND ANALYSIS Chapter 11. Building Functions 161 1.Generating Functions 161 2.Dirichlet Series 167 3.The Riemann Zeta-Function 169 4.Functional Equations 171 5.Euler Products 174 6.Build Your Own Zeta-Function 176 Chapter 12. Analytic Continuation 181 1.A Difference that Makes a Difference 181 2.Taylor Made 185 3.Analytic Functions 187 4.Analytic Continuation 192 5.Zeroes, Poles, and the Leading Coefficient 196 Chapter 13. L-functions 199 1.A Fertile Idea 199 2.The Hasse-Weil Zeta-Function 200 3.The L-Function of a Curve 205 4.The L-Function of an Elliptic Curve 207 5.Other L-Functions 212 Chapter 14. Surprising Properties of L-functions 215 1.Compare and Contrast 215 2.Analytic Continuation 220 3.Functional Equation 221 Chapter 15. The Conjecture of Birch and Swinnerton-Dyer 225 1.How Big Is Big? 225 2.Influences of the Rank on the Np's 228 3.How Small Is Zero? 232 4.The BSD Conjecture 236 5.Computational Evidence for BSD 238 6.The Congruent Number Problem 240 Epilogue 245 Retrospect 245 Where DoWe Go from Here? 247 Bibliography 249 Index 251

Read more less

Book SynopsisMagic tricks can be easy to perform and have an interesting mathematical foundation. In this rich, colourfully illustrated volume, Ehrhard Behrends presents around 30 card tricks and number games that are easy to learn, with no prior knowledge required. This is maths as you've never experienced it before: entertaining and fun!Table of Contents You can count on it Let's mix it up! Optimally packaged information: Coding Chance makes magic Appendix References.

Read more less

Book SynopsisIntroducing the Collins Modern Classics, a series featuring some of the most significant books of recent times, books that shed light on the human experience classics which will endure for generations to come.Maths is one of the purest forms of thought, and to outsiders mathematicians may seem almost otherworldly'In 1963, schoolboy Andrew Wiles stumbled across the world's greatest mathematical problem: Fermat's Last Theorem. Unsolved for over 300 years, he dreamed of cracking it.Combining thrilling storytelling with a fascinating history of scientific discovery, Simon Singh uncovers how an Englishman, after years of secret toil, finally solved mathematics' most challenging problem.Fermat's Last Theorem is remarkable story of human endeavour, obsession and intellectual brilliance, sealing its reputation as a classic of popular science writing.To read it is to realise that there is a world of beauty and intellectual challenge that is denied to 99.9 per cent of us who are not high-level mathematicians'The TimesTrade Review‘This is probably the best popular account of a scientific topic I have ever read’ Irish Times ‘Reads like the chronicle of an obsessive love affair. It has the classic ingredients that Hollywood would recognise’ Daily Mail ‘To read it is to realise that there is a world of beauty and intellectual challenge that is denied to 99.9 per cent of us who are not high-level mathematicians’ The Times ‘This tale has all the elements of a most exciting story: an impenetrable riddle; the ambition and frustration of generations of hopefuls; and the genius who worked for years in secrecy to realise his childhood dream’ Express

Read more less

Book Synopsis

Read more less

Book Synopsis

Read more less

Book SynopsisTable of Contents1. Matrices 2. Simultaneous linear equations 3. The inverse 4. An introduction to optimization 5. Determinants 6. Eigenvalues and eigenvectors 7. Matrix calculus 8. Linear differential equations 9. Probability and Markov chains 10. Real inner products and least square 11. Sabermetrics e An introduction 12. Sabermetrics e A module Appendix: A word on technology Answers and hints to selected problems

Read more less

Book SynopsisThis book is a general introduction to the theory of schemes, followed by applications to arithmetic surfaces and to the theory of reduction of algebraic curves. The first part introduces basic objects such as schemes, morphisms, base change, local properties (normality, regularity, Zariski''s Main Theorem). This is followed by the more global aspect: coherent sheaves and a finiteness theorem for their cohomology groups. Then follows a chapter on sheaves of differentials, dualizing sheaves, and Grothendieck''s duality theory. The first part ends with the theorem of Riemann-Roch and its application to the study of smooth projective curves over a field. Singular curves are treated through a detailed study of the Picard group.The second part starts with blowing-ups and desingularisation (embedded or not) of fibered surfaces over a Dedekind ring that leads on to intersection theory on arithmetic surfaces. Castelnuovo''s criterion is proved and also the existence of the minimal regular modeTrade ReviewWill be useful to graduate students as an introduction to arithmetic algebraic geometry, and to more advanced readers and experts in the field. * EMS *This book is unique in the current literature on algebraic and arithmetic geometry, therefore a highly welcome addition to it, and particularly suitable for readers who want to approach more specialized works in this field with more ease. The exposition is exceptionally lucid, rigorous, coherent and comprehensive. * Zentralblatt MATH *A thorough and far-reaching introduction to algebraic geometry in its scheme-theoretic setting ... The rich bibliography with nearly 100 references enhances the value of this textbook as a great introduction and source for research. * Zentralblatt MATH *Table of ContentsIntroduction ; 1. Some topics in commutative algebra ; 2. General Properties of schemes ; 3. Morphisms and base change ; 4. Some local properties ; 5. Coherent sheaves and Cech cohmology ; 6. Sheaves of differentials ; 7. Divisors and applications to curves ; 8. Birational geometry of surfaces ; 9. Regular surfaces ; 10. Reduction of algebraic curves ; Bibilography ; Index

Read more less

Book SynopsisPresents easy to understand proofs of some of the most difficult results about polynomials demonstrated by means of applications.Trade ReviewPresents easy to understand proofs of some of the most difficult results about polynomials demonstrated by means of applications ... Brings to the subject an immense range of reference to the study of polynomials. Professional and academic mathematicians of complex analysis, approximation theory and theoretical numerical analysis; graduate students in mathematics; engineers, statisticians and theoretical physicists, who have an interest in the important results about polynomials, will not do better than start with reading and referring to this book. * Current Engineering Practice *A nicely written book that will be useful for scientists, engineers and mathematicians from other fields. It can be strongly recommended as an undergraduate or graduate text and as a comprehensive source for self study. * EMS *Table of Contents2. FUNDAMENTAL RESULTS ON CRITICAL POINTS ; 8. INCLUSION OF ALL ZEROS ; 12. GROWTH ESTIMATES

Read more less

Book Synopsis

Read more less

Book SynopsisFollowing a brief discussion of the necessary algebro-geometric results, the book proceeds with an exposition of the geometry and the formal group of elliptic curves, elliptic curves over finite fields, the complex numbers, local fields, and global fields.Trade ReviewFrom the reviews of the second edition:"This well-written book covers the basic facts about the geometry and arithmetic of elliptic curves, and is sure to become the standard reference in the subject. It meets the needs of at least three groups of people: students interested in doing research in Diophantine geometry, mathematicians needing a reference for standard facts about elliptic curves, and computer scientists interested in algorithms and needing an introduction to elliptic curves..."-- MATHEMATICAL REVIEWS“The book under review is the second, revised, enlarged, and updated edition of J. Silverman’s meanwhile classical primer of the arithmetic of elliptic curves. … All together, this enlarged and updated version of J. Silverman’s classic ‘The Arithmetic of Elliptic Curves’ significantly increases the unchallenged value of this modern primer as a standard textbook in the field. … This makes the entire text a perfect source for teachers and students, for courses and self-study, and for further studies in the arithmetic of elliptic curves likewise.” (Werner Kleinert, Zentralblatt MATH, Vol. 1194, 2010)“For the second edition of his masterly book, the author considerably updated and improved several results and proofs. … book contains a great many exercises, many of which develop or complement the results from the main body of the book. … The reference list contains 317 items and reflects both classical and recent achievements on the topic. Notes on the exercises are an aid to the reader. … Summarizing, this is an excellent book … . useful both for experienced mathematicians and for graduate students.”­­­ (Vasil' I. Andriĭchuk, Mathematical Reviews, Issue 2010 i)“This is the second edition of an excellent textbook on the arithmetical theory of elliptic curves … . Although there are now a number of good books on this topic it has stood the test of time and become a popular introductory text and a standard reference. … The author has added remarks which point out their significance and connection to those parts of the theory he presents. These will give readers a good start if they want to study one of them.” (Ch. Baxa, Monatshefte für Mathematik, Vol. 164 (3), November, 2011)“The book is written for graduate students … and for researchers interested in standard facts about elliptic curves. … A wonderful textbook on the arithmetic theory of elliptic curves and it is a very popular introduction to the subject. … I recommend this book for anyone interested in the mathematical study of elliptic curves. It is an excellent introduction, elegant and very well written. It is one of the best textbooks to graduate level studies I have ever had contact yet.” (Book Inspections Blog, 2012)Table of ContentsAlgebraic Varieties.- Algebraic Curves.- The Geometry of Elliptic Curves.- The Formal Group of an Elliptic Curve.- Elliptic Curves over Finite Fields.- Elliptic Curves over C.- Elliptic Curves over Local Fields.- Elliptic Curves over Global Fields.- Integral Points on Elliptic Curves.- Computing the Mordell#x2013;Weil Group.- Algorithmic Aspects of Elliptic Curves.

Read more less

Book Synopsis1 Integers.- 2 Congruences and Residue Class Rings.- 3 Encryption.- 4 Probability and Perfect Secrecy.- 5 DES.- 6 AES.- 7 Prime Number Generation.- 8 Public-Key Encryption.- 9 Factoring.- 10 Discrete Logarithms.- 11 Cryptographic Hash Functions.- 12 Digital Signatures.- 13 Other Systems.- 14 Identification.- 15 Secret Sharing.- 16 Public-Key Infrastructures.- Solutions of the exercises.- References.Trade ReviewFrom the reviews: Zentralblatt Math "[......] Of the three books under review, Buchmann's is by far the most sophisticated, complete and up-to-date. It was written for computer-science majors - German ones at that - and might be rough going for all but the best American undergraduates. It is amazing how much Buchmann is able to do in under 300 pages: self-contained explanations of the relevant mathematics (with proofs); a systematic introduction to symmetric cryptosystems, including a detailed description and discussion of DES; a good treatment of primality testing, integer factorization, and algorithms for discrete logarithms, clearly written sections describing most of the major types of cryptosystems, and explanations of basic concepts of practical cryptography such as hash functions, message authentication codes, signatures, passwords, certification authorities, and certificate chains. This book is an excellent reference, and I believe that it would also be a good textbook for a course for mathematics or computer science majors, provided that the instructor is prepared to supplement it with more leisurely treatments of some of the topics." N. Koblitz (Seattle, WA) - American Math. Society Monthly. J.A. Buchmann Introduction to Cryptography "It gives a clear and systematic introduction into the subject whose popularity is ever increasing, and can be recommended to all who would like to learn about cryptography. The book contains many exercises and examples. It can be used as a textbook and is likely to become popular among students. The necessary definitions and concepts from algebra, number theory and probability theory are formulated, illustrated by examples and applied to cryptography." —ZENTRALBLATT MATH "For those of use who wish to learn more about cryptography and/or to teach it, Johannes Buchmann has written this book. … The book is mathematically complete and a satisfying read. There are plenty of homework exercises … . This is a good book for upperclassmen, graduate students, and faculty. … This book makes a superior reference and a fine textbook." (Robert W. Vallin, MathDL, January, 2001) "Buchmann’s book is a text on cryptography intended to be used at the undergraduate level. … the intended audiences of this book are ‘readers who want to learn about modern cryptographic algorithms and their mathematical foundations … . I enjoy reading this book. … Readers will find a good exposition of the techniques used in developing and analyzing these algorithms. … These make Buchmann’s text an excellent choice for self study or as a text for students … in elementary number theory and algebra." (Andrew C. Lee, SIGACT News, Vol. 34 (4), 2003) From the reviews of the second edition: "This is the english translation of the second edition of the author’s prominent german textbook ‘Einführung in die Kryptographie’. The original text grew out of several courses on cryptography given by the author at the Technical University Darmstadt; it is aimed at readers who want to learn about modern cryptographic techniques and its mathematical foundations … . As compared with the first edition the number of exercises has almost been doubled and some material … has been added." (R. Steinbauer, Monatshefte für Mathematik, Vol. 150 (4), 2007)Table of ContentsIntegers.- Congruences and Residue Class Rings.- Encryption.- Probability and Perfect Secrecy.- DES.- AES.- Prime Number Generation.- Public-Key Encryption.- Factoring.- Discrete Logarithms.- Cryptographic Hash Functions.- Digital Signatures.- Other Systems.- Identification.- Public-Key Infrastructures.- Solutions of the Odd Exercises.- Subject Index.- Bibliography.

Read more less

Book SynopsisMarks the 20th anniversary of the New York Number Theory Seminar (NYNTS). Beginning in 1982, the NYNTS has tried to present research in number theory and related fields of mathematics, from physics to geometry to combinatorics and computer science. The list of seminar speakers includes Fields Medallists and other established researchers.Table of ContentsThe spanning number and the independence number of a subset of an abelian group.- A formula related to the Frobenius problem in two dimensions.- One bit world.- Use of Pade approximation in spline construction.- Interactions between number theory and operator algebras in the study of Riemann zeta function (d'apres Bost-Connes and Connes).- A hyperelliptic curve with real multiplication of degree two.- Humbert's conic model and the Kummer surface.- Arithmeticity and theta correspondence of an orthogonal group.- Morphis heights and periodic points.- The elementary proof of the prime number theorem: An historical perspective.- Additive bases representations and the Erdos-Turan conjecture.- The boundary structure of the sumset in Z^2.- On NTU's in function fields.- Continued fractions and quadratic irrationals.- The inverse problem for representation functions of additive bases.- On the ubiquity of Sidon sets.

Read more less

Book SynopsisProblems.- Arithmetic Functions.- Primes in Arithmetic Progressions.- The Prime Number Theorem.- The Method of Contour Integration.- Functional Equations.- Hadamard Products.- Explicit Formulas.- The Selberg Class.- Sieve Methods.- p-adic Methods.- Equidistribution.- Solutions.- Arithmetic Functions.- Primes in Arithmetic Progressions.- The Prime Number Theorem.- The Method of Contour Integration.- Functional Equations.- Hadamard Products.- Explicit Formulas.- The Selberg Class.- Sieve Methods.- p-adic Methods.- Equidistribution.Trade ReviewM.R. MurtyProblems in Analytic Number Theory"The reviewer strongly approves of the problem-based approach to learning, and recommends this book to any student of analytic number theory."—MATHEMATICAL REVIEWSFrom the reviews of the second edition:“This expanded and corrected second edition of this useful and interesting book has a new chapter on the topic of equidistribution. … this monograph gives important results and techniques for specific topics, together with many exercises. … I do enjoy this book … and I imagine when I take the graduate course in the subject that it will be of a greater benefit, which is why I offered such a high rating.” (Philosophy, Religion and Science Book Reviews, bookinspections.wordpress.com, July, 2013)"The second edition of the book has eleven chapters … . the book can be used both as a problem book (as its title shows) and also as a textbook (as the series in which the book is published shows). … is ideal as a text for a first course in analytic number theory, either at the senior undergraduate or the graduate level. … I believe that this book will be very useful for students, researchers and professors. It is well written … ." (Mehdi Hassani, MathDL, April, 2008)Table of ContentsProblems.- Arithmetic Functions.- Primes in Arithmetic Progressions.- The Prime Number Theorem.- The Method of Contour Integration.- Functional Equations.- Hadamard Products.- Explicit Formulas.- The Selberg Class.- Sieve Methods.- p-adic Methods.- Equidistribution.- Solutions.- Arithmetic Functions.- Primes in Arithmetic Progressions.- The Prime Number Theorem.- The Method of Contour Integration.- Functional Equations.- Hadamard Products.- Explicit Formulas.- The Selberg Class.- Sieve Methods.- p-adic Methods.- Equidistribution.

Read more less

Book SynopsisHistorical Introduction.- 1 The Fundamental Theorem of Arithmetic.- 2 Arithmetical Functions and Dirichlet Multiplication.- 3 Averages of Arithmetical Functions.- 4 Some Elementary Theorems on the Distribution of Prime Numbers.- 5 Congruences.- 6 Finite Abelian Groups and Their Characters.- 7 Dirichlet's Theorem on Primes in Arithmetic Progressions.- 8 Periodic Arithmetical Functions and Gauss Sums.- 9 Quadratic Residues and the Quadratic Reciprocity Law.- 10 Primitive Roots.- 11 Dirichlet Series and Euler Products.- 12 The Functions ?(s) and L(s, ?).- 13 Analytic Proof of the Prime Number Theorem.- 14 Partitions.- Index of Special Symbols.Trade ReviewFrom the reviews:T.M. ApostolIntroduction to Analytic Number Theory"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. The presentation is invariably lucid and the book is a real pleasure to read."—MATHEMATICAL REVIEWS“After reading Introduction to Analytic Number Theory one is left with the impression that the author, Tom M. Apostal, has pulled off some magic trick. … I must admit that I love this book. The selection of topics is excellent, the exposition is fluid, the proofs are clear and nicely structured, and every chapter contains its own set of … exercises. … this book is very readable and approachable, and it would work very nicely as a text for a second course in number theory.” (Álvaro Lozano-Robledo, The Mathematical Association of America, December, 2011)Table of Contents1: The Fundamental Theorem of Arithmetic. 2: Arithmetical Functions and Dirichlet Multiplication. 3: Averages of Arithmetical Function. 4: Some Elementary Theorems on the Distribution of Prime Numbers. 5: Congruences. 6: Finite Abelian Groups and Their Characters. 7: Cirichlet's Theorem on Primes in Arithmetic Progressions. 8: Periodic Arithmetical Functions and Gauss Sums. 9: Quadratic Residues and the Quadratic Reciprocity Law. 10: Primitive Roots. 11: Dirichlet Series and Euler Products. 12: The Functions. 13: Analytic Proof of the Prime Number Theorem. 14: Partitions.

Read more less

Book SynopsisOne General Basic Theory.- I Algebraic Integers.- II Completions.- III The Different and Discriminant.- IV Cyclotomic Fields.- V Parallelotopes.- VI The Ideal Function.- VII Ideles and Adeles.- VIII Elementary Properties of the Zeta Function and L-series.- Two Class Field Theory.- IX Norm Index Computations.- X The Artin Symbol, Reciprocity Law, and Class Field Theory.- XI The Existence Theorem and Local Class Field Theory.- XII L-series Again.- Three Analytic Theory.- XIII Functional Equation of the Zeta Function, Hecke's Proof.- XIV Functional Equation, Tate's Thesis.- XV Density of Primes and Tauberian Theorem.- XVI The Brauer-Siegel Theorem.- XVII Explicit Formulas.Trade ReviewSecond Edition S. Lang Algebraic Number Theory "This book is the second edition of Lang's famous and indispensable book on algebraic number theory. The major change from the previous edition is that the last chapter on explicit formulas has been completely rewritten. In addition, a few new sections have been added to the other chapters . . . Lang's books are always of great value for the graduate student and the research mathematician. This updated edition of Algebraic number theory is no exception."—MATHEMATICAL REVIEWSTable of ContentsOne General Basic Theory.- I Algebraic Integers.- II Completions.- III The Different and Discriminant.- IV Cyclotomic Fields.- V Parallelotopes.- VI The Ideal Function.- VII Ideles and Adeles.- VIII Elementary Properties of the Zeta Function and L-series.- Two Class Field Theory.- IX Norm Index Computations.- X The Artin Symbol, Reciprocity Law, and Class Field Theory.- XI The Existence Theorem and Local Class Field Theory.- XII L-series Again.- Three Analytic Theory.- XIII Functional Equation of the Zeta Function, Hecke’s Proof.- XIV Functional Equation, Tate’s Thesis.- XV Density of Primes and Tauberian Theorem.- XVI The Brauer-Siegel Theorem.- XVII Explicit Formulas.

Read more less

Book SynopsisIn the introduction to the first volume of The Arithmetic of Elliptic Curves (Springer-Verlag, 1986), I observed that "the theory of elliptic curves is rich, varied, and amazingly vast," and as a consequence, "many important topics had to be omitted."Table of Contents1.- I Elliptic and Modular Functions.- §1. The Modular Group.- §2. The Modular Curve X(1).- §3. Modular Functions.- §4. Uniformization and Fields of Moduli.- §5. Elliptic Functions Revisited.- §6. q-Expansions of Elliptic Functions.- §7. q-Expansions of Modular Functions.- §8. Jacobi’s Product Formula for ?(?).- §9. Hecke Operators.- §10. Hecke Operators Acting on Modular Forms.- §11. L-Series Attached to Modular Forms.- Exercises.- II Complex Multiplication.- §1. Complex Multiplication over C.- §2. Rationality Questions.- §3. Class Field Theory — A Brief Review.- §4. The Hilbert Class Field.- §5. The Maximal Abelian Extension.- §6. Integrality of j.- §7. Cyclotomic Class Field Theory.- §8. The Main Theorem of Complex Multiplication.- §9. The Associated Grössencharacter.- §10. The L-Series Attached to a CM Elliptic Curve.- Exercises.- III Elliptic Surfaces.- §1. Elliptic Curves over Function Fields.- §2. The Weak Mordell-Weil Theorem.- §3. Elliptic Surfaces.- §4. Heights on Elliptic Curves over Function Fields.- §5. Split Elliptic Surfaces and Sets of Bounded Height.- §6. The Mordell-Weil Theorem for Function Fields.- §7. The Geometry of Algebraic Surfaces.- §8. The Geometry of Fibered Surfaces.- §9. The Geometry of Elliptic Surfaces.- §10. Heights and Divisors on Varieties.- §11. Specialization Theorems for Elliptic Surfaces.- §12. Integral Points on Elliptic Curves over Function Fields.- Exercises.- IV The Néron Model.- §1. Group Varieties.- §2. Schemes and S-Schemes.- §3. Group Schemes.- §4. Arithmetic Surfaces.- §5. Néron Models.- §6. Existence of Néron Models.- §7. Intersection Theory, Minimal Models, and Blowing-Up.- §8. The Special Fiber of a Néron Model.- §9. Tate’s Algorithm to Compute the Special Fiber.- §10. The Conductor of an Elliptic Curve.- §11. Ogg’s Formula.- Exercises.- V Elliptic Curves over Complete Fields.- §1. Elliptic Curves over ?.- §2. Elliptic Curves over ?.- §3. The Tate Curve.- §4. The Tate Map Is Surjective.- §5. Elliptic Curves over p-adic Fields.- §6. Some Applications of p-adic Uniformization.- Exercises.- VI Local Height Functions.- §1. Existence of Local Height Functions.- §2. Local Decomposition of the Canonical Height.- §3. Archimedean Absolute Values — Explicit Formulas.- §4. Non-Archimedean Absolute Values — Explicit Formulas.- Exercises.- Appendix A Some Useful Tables.- §3. Elliptic Curves over ? with Complex Multiplication.- Notes on Exercises.- References.- List of Notation.

Read more less

Book SynopsisThe new edition of this thorough examination of the distribution of prime numbers in arithmetic progressions offers many revisions and corrections as well as a new section recounting recent works in the field.Trade ReviewFrom the reviews of the third edition: "The book under review is one of the most important references in the multiplicative number theory, as its title mentions exactly. … Davenport’s book covers most of the important topics in the theory of distribution of primes and leads the reader to serious research topics … . is very well written. … is useful for graduate students, researchers and for professors. It is a very good text source specially for graduate levels, but even is fruitful for undergraduates." (Mehdi Hassani, MathDL, July, 2008)Table of ContentsFrom the contents: Primes in Arithmetic Progression.- Gauss' Sum.- Cyclotomy.- Primes in Arithmetic Progression: The General Modulus.- Primitive Characters.- Dirichlet's Class Number Formula.- The Distribution of the Primes.- Riemann's Memoir.- The Functional Equation of the L Function.- Properties of the Gamma Function.- Integral Functions of Order 1.- The Infinite Products for xi(s) and xi(s,Zero-Free Region for zeta(s).- Zero-Free Regions for L(s, chi).- The Number N(T).- The Number N(T, chi).- The explicit Formula for psi(x).- The Prime Number Theorem.- The Explicit Formula for psi(x,chi).- The Prime Number Theorem for Arithmetic Progressions (I).- Siegel's Theorem.- The Prime Number Theorem for Arithmetic Progressions (II).- The Pólya-Vinogradov Inequality.- Further Prime Number Sums.

Read more less

Book Synopsis1. Divisibility, the Fundamental Theorem of Number Theory.- 2. Congruences.- 3. Rational and Irrational Numbers. Approximation of Numbers by Rational Numbers (Diophantine Approximation).- 4. Geometric Methods in Number Theory.- 5. Properties of Prime Numbers.- 6. Sequences of Integers.- 7. Diophantine Problems.- 8. Arithmetic Functions.- Hints to the More Difficult Exercises.Trade ReviewFrom the reviews: "Read this book just for Erdös’s (Erdos’s) characteristic turn of thought, or for results hard to find elsewhere, such as a finiteness theorem concerning odd perfect numbers with a fixed number of factors. Summing Up: Recommended. Lower-division undergraduates through professionals." (D.V. Feldman, CHOICE, December, 2003) "This is an English translation of the second edition of a book originally published over 40 years ago … . The contents should be accessible to, and inspire and challenge, keen pre-university students as well as giving the experienced mathematician food for thought. The proofs are elementary and largely self-contained, and the problems and results well motivated. … This translation makes a very clearly and nicely written book available to many more readers who should benefit and gain much pleasure from studying it." (Eira J. Scourfield, Zentralblatt MATH, Issue 1018, 2003) "This rather unique book is a guided tour through number theory. While most introductions to number theory provide a systematic and exhaustive treatment of the subject, the authors have chosen instead to illustrate the many varied subjects by associating recent discoveries, interesting methods, and unsolved problems. … János Surányi’s vast teaching experience successfully complements Paul Erdös’s ability to initiate new directions of research by suggesting new problems and approaches." (L’Enseignement Mathematique, Vol. 49 (1-2), 2003) "This is a somewhat enlarged translation of the Hungarian book … . It goes without saying that the text is masterly written. It contains on comparatively few lines the fundamental ideas of not only elementary Number Theory: it contains also irrationality proofs ... . The book is hence by far not an n-th version of always the same matter. The style reminds me on the celebrated book of Pólya … . It is desirable that the book under discussion should have a similar success." (J. Schoissengeier, Monatshefte für Mathematik, Vol. 143 (2), 2004) "This an introduction to elementary number theory in which the authors present the main notions of that theory and ‘try to give glimpses into the deeper related mathematics’, as they write in the preface. There are 8 chapters … . Each of them brings not only the notions and theorems (sometimes with unconventional proofs) which usually appear in introductory texts, but discusses also topics found rarely … . One also finds several interesting historical comments." (W. Narkiewicz, Mathematical Reviews, 2003j)Table of Contents* Preface * Facts Used Without Proof in the Book * Divisibility, the Fundamental Theorem of Number Theory * Congruences * Rational and irrational numbers. Approximation of numbers by rational numbers. (Diophantine approximation.) * Geometric methods in number theory * Properties of prime numbers * Sequences of integers * Diophantine Problems * Arithmetic Functions * Hints to the more difficult exercises * Bibliography * Index

Read more less

Book SynopsisThe first edition of this work has become the standard introduction to the theory of p-adic numbers at both the advanced undergraduate and beginning graduate level.Trade ReviewFrom the reviews of the second edition:“In the second edition of this text, Koblitz presents a wide-ranging introduction to the theory of p-adic numbers and functions. … there are some really nice exercises that allow the reader to explore the material. … And with the exercises, the book would make a good textbook for a graduate course, provided the students have a decent background in analysis and number theory.” (Donald L. Vestal, The Mathematical Association of America, April, 2011)Table of ContentsI p-adic numbers.- 1. Basic concepts.- 2. Metrics on the rational numbers.- Exercises.- 3. Review of building up the complex numbers.- 4. The field of p-adic numbers.- 5. Arithmetic in ?p.- Exercises.- II p-adic interpolation of the Riemann zeta-function.- 1. A formula for ?(2k).- 2. p-adic interpolation of the function f(s) = as.- Exercises.- 3. p-adic distributions.- Exercises.- 4. Bernoulli distributions.- 5. Measures and integration.- Exercises.- 6. The p-adic ?-function as a Mellin-Mazur transform.- 7. A brief survey (no proofs).- Exercises.- III Building up ?.- 1. Finite fields.- Exercises.- 2. Extension of norms.- Exercises.- 3. The algebraic closure of ?p.- 4. ?.- Exercises.- IV p-adic power series.- 1. Elementary functions.- Exercises.- 2. The logarithm, gamma and Artin-Hasse exponential functions.- Exercises.- 3. Newton polygons for polynomials.- 4. Newton polygons for power series.- Exercises.- V Rationality of the zeta-function of a set of equations over a finite field.- 1. Hypersurfaces and their zeta-functions.- Exercises.- 2. Characters and their lifting.- 3. A linear map on the vector space of power series.- 4. p-adic analytic expression for the zeta-function.- Exercises.- 5. The end of the proof.- Answers and Hints for the Exercises.

Read more less

Book Synopsis1 Elementary Concepts.- 2 Reduction of Positive Definite Forms.- 3 Indefinite Forms.- 3.1 Reduction, Cycles.- 3.2 Automorphs, Pell's Equation.- 3.3 Continued Fractions and Indefinite Forms.- 4 The Class Group.- 4.1 Representation and Genera.- 4.2 Composition Algorithms.- 4.3 Generic Characters Revisited.- 4.4 Representation of Integers.- 5 Miscellaneous Facts.- 5.1 Class Number Computations.- 5.2 Extreme Cases and Asymptotic Results.- 6 Quadratic Number Fields.- 6.1 Basic Algebraic Definitions.- 6.2 Algebraic Numbers and Quadratic Fields.- 6.3 Ideals in Quadratic Fields.- 6.4 Binary Quadratic Forms and Classes of Ideals.- 6.5 History.- 7 Composition of Forms.- 7.1 Nonfundamental Discriminants.- 7.2 The General Problem of Composition.- 7.3 Composition in Different Orders.- 8 Miscellaneous Facts II.- 8.1 The Cohen-Lenstra Heuristics.- 8.2 Decomposing Class Groups.- 8.3 Specifying Subgroups of Class Groups.- 9 The 2-Sylow Subgroup.- 9.1 Classical Results on the Pell Equation.- 9.2 ModernRTable of Contents1 Elementary Concepts.- 2 Reduction of Positive Definite Forms.- 3 Indefinite Forms.- 3.1 Reduction, Cycles.- 3.2 Automorphs, Pell’s Equation.- 3.3 Continued Fractions and Indefinite Forms.- 4 The Class Group.- 4.1 Representation and Genera.- 4.2 Composition Algorithms.- 4.3 Generic Characters Revisited.- 4.4 Representation of Integers.- 5 Miscellaneous Facts.- 5.1 Class Number Computations.- 5.2 Extreme Cases and Asymptotic Results.- 6 Quadratic Number Fields.- 6.1 Basic Algebraic Definitions.- 6.2 Algebraic Numbers and Quadratic Fields.- 6.3 Ideals in Quadratic Fields.- 6.4 Binary Quadratic Forms and Classes of Ideals.- 6.5 History.- 7 Composition of Forms.- 7.1 Nonfundamental Discriminants.- 7.2 The General Problem of Composition.- 7.3 Composition in Different Orders.- 8 Miscellaneous Facts II.- 8.1 The Cohen-Lenstra Heuristics.- 8.2 Decomposing Class Groups.- 8.3 Specifying Subgroups of Class Groups.- 8.3.1 Congruence Conditions.- 8.3.2 Exact and Exotic Groups.- 9 The 2-Sylow Subgroup.- 9.1 Classical Results on the Pell Equation.- 9.2 Modern Results.- 9.3 Reciprocity Laws.- 9.4 Special References for Chapter 9.- 10 Factoring with Binary Quadratic Forms.- 10.1 Classical Methods.- 10.2 SQUFOF.- 10.3 CLASNO.- 10.4 SPAR.- 10.4.1 Pollard p — 1.- 10.4.2 SPAR.- 10.5 CFRAC.- 10.6 A General Analysis.- Appendix 1:Tables, Negative Discriminants.- Appendix 2:Tables, Positive Discriminants.

Read more less

Book SynopsisSome of the central topics in number theory, presnted in a simple and concise fashion. All the topics are presented in a refreshingly elegant and efficient manner with clever examples and interesting problems throughout. The text is suitable for a graduate course in analytic number theory.Trade ReviewFrom the reviews:D. J. NewmanAnalytic Number Theory"This book is remarkable . . . The author’s style remains pleasantly discursive throughout the book. Any of these chapters might be useful to a reader planning a lecture course in the relevant subject area . . . The student of analytic number theory would do well to find shelf-room for this book."—MATHEMATICAL “Donald J. Newman was a noted problem-solver who believed that math should be fun and that beautiful theorems should have beautiful proofs. This short book collects brief, self-contained proofs of several well-known theorems in analytic number theory … .” (Allen Stenger, The Mathematical Association of America, November, 2010)Table of ContentsThe Idea of Analytic Number Theory.- The Partition Function.- The Erd?s-Fuchs Theorem.- Sequences without Arithmetic Progressions.- The Waring Problem.- A “Natural” Proof of the Nonvanishing of L-Series.- Simple Analytic Proof of the Prime Number Theorem.

Read more less

Book SynopsisIt offers many features rarely treated in introductory p-adic texts such as topological models of p-adic spaces inside Euclidian space, a special case of Hazewinkel’s functional equation lemma, and a treatment of analytic elements.Trade Review“This well-written book, complete with all proofs and a wealth of exercises, is perfectly suited as a text book for introductory courses.” (Wim Schikhof, zbMATH 0947.11035, 2022)From the reviews: MATHEMATICAL REVIEWS "The text ends with a large number of exercises. The writing is extremely clear and very meticulous. The bibliography, which does not attempt to be comprehensive, is adequate. I recommend A. Robert’s book without reservation to anyone who wants to have a reference text on one-variable p-adic analysis that is clear, complete and pleasant to read." MATHSCINET "Robert's book is aimed at an intermediate level between the very specialized monographs and the elementary texts. It has no equal in the marketplace, because it covers practically all of p-adic analysis of one variable (except the rationality of the zeta function of an algebraic variety over a finite field and the theory of p-adic differential equations) and contains numerous results that were accessible only in articles or even in preprints. ...I recommend A. Robert's book without reservation to anyone who wants to have a reference text on one-variable p-adic analysis that is clear, complete and pleasant to read."D. Barsky in MathSciNet, August 2001Table of Contents1 p-adic Numbers.- 2 Finite Extensions of the Field of p-adic Numbers.- 3 Construction of Universal p-adic Fields.- 4 Continuous Functions on Zp.- 5 Differentiation.- 6 Analytic Functions and Elements.- 7 Special Functions, Congruences.- Specific References for the Text.- Tables.- Basic Principles of Ultrametric Analysis.- Conventions, Notation, Terminology.

Read more less

Book SynopsisA Course in Computational Number Theory uses the computer as a tool for motivation and explanation. The book is designed for the reader to quickly access a computer and begin doing personal experiments with the patterns of the integers. It presents and explains many of the fastest algorithms for working with integers. Traditional topics are covered, but the text also explores factoring algorithms, primality testing, the RSA public-key cryptosystem, and unusual applications such as check digit schemes and a computation of the energy that holds a salt crystal together. Advanced topics include continued fractions, Pell's equation, and the Gaussian primes.Table of ContentsPreface. Notation. Chapter 1 Fundamentals. 1.0 Introduction. 1.1 A Famous Sequence of Numbers. 1.2 The Euclidean ALgorithm. The Oldest Algorithm. Reversing the Euclidean Algorithm. The Extended GCD Algorithm. The Fundamental Theorem of Arithmetic. Two Applications. 1.3 Modular Arithmetic. 1.4 Fast Powers. A Fast Alforithm for ExponentiationPowers of Matrices, Big-O Notation. Chapter 2 Congruences, Equations, and Powers. 2.0 Introduction. 2.1 Solving Linear Congruences. Linear Diophantine Equations in Two Variables. The Conductor. An Importatnt Quadratic Congruence. 2.2 The Chinese Remainder Theorem. 2.3 PowerMod Patterns. Fermat's Little Theorem. More Patterns in Powers. 2.4 Pseudoprimes. Using the Pseudoprime Test. Chapter 3 Euler's Function. 3.0 Introduction. 3.1 Euler's Function. 3.2 Perfect Numbers and Their Relatives. The Sum of Divisors Function. Perfect Numbers. Amicalbe, Abundant, and Deficient Numbers. 3.3 Euler's Theorem. 3.4 Primitive Roots for Primes. The order of an Integer. Primes Have PRimitive roots. Repeating Decimals. 3.5 Primitive Roots for COmposites. 3.6 The Universal Exponent. Universal Exponents. Power Towers. The Form of Carmichael Numbers. Chapter 4 Prime Numbers. 4.0 Introduction. 4.1 The Number of Primes. We'll Never Run Out of Primes. The Sieve of Eratosthenes. Chebyshev's Theorem and Bertrand's Postulate. 4.2 Prime Testing and Certification. Strong Pseudoprimes. Industrial-Grade Primes. Prime Certification Via Primitive Roots. An Improvement. Pratt Certificates. 4.3 Refinements and Other Directions. Other PRimality Tests. Strong Liars are Scarce. Finding the nth Prime. 4.4 A Doszen Prime Mysteries. Chapter 5 Some Applications. 5.0 Introduction. 5.1 Coding Secrets. Tossing a Coin into a Well. The RSA Cryptosystem. Digital Signatures. 5.2 The Yao Millionaire Problem. 5.3 Check Digits. Basic Check Digit Schemes. A Perfect Check Digit Method. Beyond Perfection: Correcting Errors. 5.4 Factoring Algorithms. Trial Division. Fermat's Algorithm. Pollard Rho. Pollard p-1. The Current Scene. Chapter 6 Quadratic Residues. 6.0 Introduction. 6.1 Pepin's Test. Quadratic Residues. Pepin's Test. Primes Congruent to 1 (Mod. 6.2 Proof of Quadratic Reciprocity. Gauss's Lemma. Proof of Quadratic Recipocity. Jacobi's Extension. An Application to Factoring. 6.3 Quadratic Equations. Chapter 7 Continuec Faction. 7.0 Introduction. 7.1 FInite COntinued Fractions. 7.2 Infinite Continued Fractions. 7.3 Periodic Continued Fractions. 7.4 Pell's Equation. 7.5 Archimedes and the Sun God's Cattle. Wurm's Version: Using Rectangular Bulls. The Real Cattle Problem. 7.6 Factoring via Continued Fractions. Chapter 8 Prime Testing with Lucas Sequences. 8.0 Introduction. 8.1 Divisibility Properties of Lucas Sequencese. 8.2 Prime Tests Using Lucas Sequencesse. Lucas Certification. The Lucas-Lehmer Algorithm Explained. Luca Pseudoprimes. Strong Quadratic Pseudoprimes. Primality Testing's Holy Grail. Chapter 9 Prime Imaginaries and Imaginary Primes. 9.0 Introduction. 9.1 Sums of Two Squares. 9.2 The Gaussian Intergers. Complex Number Theory. Gaussian Primes. The Moat Problem. The Gaussian Zoo. 9.3 Higher Reciprocity 325. Appendix A. Maathematica Basics. 1.0 Introduction. A.1 Plotting. A.2 Typesetting. Sending Files By E-Mail. A.3 Types of Functions. A.4 Lists. A.5 Programs. A.6 Solving Equations. A.7 Symbolic Algebra. Appendix B Lucas Certificates Exist. References. Index of Mathematica Objects. Subject Index.

Read more less

Book SynopsisNumber Theory: A Lively Introduction with Proofs, Applications, and Stories, is a new book that provides a rigorous yet accessible introduction to elementary number theory along with relevant applications. Readable discussions motivate new concepts and theorems before their formal definitions and statements are presented. Many theorems are preceded by Numerical Proof Previews, which are numerical examples that will help give students a concrete understanding of both the statements of the theorems and the ideas behind their proofs, before the statement and proof are formalized in more abstract terms. In addition, many applications of number theory are explained in detail throughout the text, including some that have rarely (if ever) appeared in textbooks. A unique feature of the book is that every chapter includes a math myth, a fictional story that introduces an important number theory topic in a friendly, inviting manner. Many of the exerciTable of ContentsPreface. To the Student. To the Instructor. Acknowledgements. 0. Prologue. 1. Numbers, Rational and Irrational. (Historical figures: Pythagoras and Hypatia). 1.1 Numbers and the Greeks. 1.2 Numbers you know. 1.3 A First Look at Proofs. 1.4 Irrationality of he square root of 2. 1.5 Using Quantifiers. 2. Mathematical Induction. (Historical figure: Noether). 2.1.The Principle of Mathematical Induction. 2.2 Strong Induction and the Well Ordering Principle. 2.3 The Fibonacci Sequence and the Golden Ratio. 2.4 The Legend of the Golden Ratio. 3. Divisibility and Primes. (Historical figure: Eratosthenes). 3.1 Basic Properties of Divisibility. 3.2 Prime and Composite Numbers. 3.3 Patterns in the Primes. 3.4 Common Divisors and Common Multiples. 3.5 The Division Theorem. 3.6 Applications of gcd and lcm. 4.The Euclidean Algorithm. (Historical figure: Euclid). 4.1 The Euclidean Algorithm. 4.2 Finding the Greatest Common Divisor. 4.3 A Greeker Argument that the square root of 2 is Irrational. 5. Linear Diophantine Equations. (Historical figure: Diophantus). 5.1 The Equation aX + bY = 1. 5.2 Using the Euclidean Algorithm to Find a Solution. 5.3 The Diophantine Equation aX + bY = n. 5.4 Finding All Solutions to a Linear Diophantine Equation. 6. The Fundamental Theorem of Arithmetic. (Historical figure: Mersenne). 6.1 The Fundamental Theorem. 6.2 Consequences of the Fundamental Theorem. 7. Modular Arithmetic. (Historical figure: Gauss). 7.1 Congruence modulo n. 7.2 Arithmetic with Congruences. 7.3 Check Digit Schemes. 7.4 The Chinese Remainder Theorem. 7.5 The Gregorian Calendar. 7.6 The Mayan Calendar. 8. Modular Number Systems. (Historical figure: Turing). 8.1 The Number System Zn: an Informal View. 8.2 The Number System Zn: Definition and Basic Properties. 8.3 Multiplicative Inverses in Zn. 8.4 Elementary Cryptography. 8.5 Encryption Using Modular Multiplication. 9. Exponents Modulo n. (Historical figure: Fermat). 9.1 Fermat's Little Theorem. 9.2 Reduced Residues and the Euler \phi-function. 9.3 Euler's Theorem. 9.4 Exponentiation Ciphers with a Prime modulus. 9.5 The RSA Encryption Algorithm. 10. Primitive Roots. (Historical figure: Lagrange). 10.1 Zn. 10.2 Solving Polynomial Equations in Zn. 10.3 Primitive Roots. 10.4 Applications of Primitive Roots. 11. Quadratic Residues. (Historical figure: Eisenstein) 11.1 Squares Modulo n 11.2 Euler's Identity and the Quadratic Character of -1 11.3 The Law of Quadratic Reciprocity 11.4 Gauss's Lemma 11.5 Quadratic Residues and Lattice Points. 11.6 The Proof of Quadratic Reciprocity. 12. Primality Testing. (Historical figure: Erdös). 12.1 Primality testing. 12.2 Continued Consideration of Charmichael Numbers. 12.3 The Miller-Rabin Primality test. 12.4 Two Special Polynomial Equations in Zp. 12.5 Proof that Millar-Rabin is Effective. 12.6 Prime Certificates. 12.7 The AKS Deterministic Primality Test. 13. Gaussian Integers. (Historical figure: Euler). 13.1 Definition of Gaussian Integers 13.2 Divisibility and Primes in Z[i]. 13.3 The Division Theorem for the Gaussian Integers. 13.4 Unique Factorization in Z[i]. 13.5 Gaussian Primes. 13.6 Fermat's Two Squares Theorem. 14. Continued Fractions. (Historical figure: Ramanujan). 14.1 Expressing Rational Numbers as Continued Fractions. 14.2 Expressing Irrational Numbers as Continued Fractions. 14.3 Approximating Irrational Numbers Using Continued Fractions. 14.4 Proving that Convergents are Fantastic Approximations. 15. Some Nonlinear Diophantine Equations. (Historical figure: Germain). 15.1 Pell's Equation 15.2 Fermat's Last Theorem 15.3 Proof of Fermat's Last Theorem for n = 4. 15.4 Germain's Contributions to Fermat's Last Theorem 15.5 A Geometric look at the Equation x4 + y4 = z2. Appendix: Axioms of Number Theory. A.1 What is a Number System? A.2 Order Properties of the Integers. A.3 Building Results From Our Axioms. A.4 The Principle of Mathematical Induction.

Read more less

Book SynopsisDevised in the 19th century, Gauss and Jacobi Sums are classical formulas that form the basis for contemporary research in many of today's sciences. This book offers readers a solid grounding on the origin of these abstract, general theories.Table of ContentsGauss Sums. Jacobi Sums and Cyclotomic Numbers. Evaluation of Jacobi Sums Over Fp. Determination of Gauss Sums Over Fp. Difference Sets. Jacobsthal Sums Over Fp. Residuacity. Reciprocity Laws. Congruences for Binomial Coefficients. Diagonal Equations over Finite Fields. Gauss Sums over Fq. Eisenstein Sums. Brewer Sums. A General Eisenstein Reciprocity Law. Research Problems. Bibliography. Notation. Indexes.

Read more less

Book SynopsisA complete, self-contained introduction to a powerful and resurging mathematical discipline. Combinatorial Geometry presents and explains with complete proofs some of the most important results and methods of this relatively young mathematical discipline, started by Minkowski, Fejes Toth, Rogers, and Erd???s.Table of ContentsARRANGEMENTS OF CONVEX SETS. Geometry of Numbers. Approximation of a Convex Set by Polygons. Packing and Covering with Congruent Convex Discs. Lattice Packing and Lattice Covering. The Method of Cell Decomposition. Methods of Blichfeldt and Rogers. Efficient Random Arrangements. Circle Packings and Planar Graphs. ARRANGEMENTS OF POINTS AND LINES. Extremal Graph Theory. Repeated Distances in Space. Arrangement of Lines. Applications of the Bounds on Incidences. More on Repeated Distances. Geometric Graphs. Epsilon Nets and Transversals of Hypergraphs. Geometric Discrepancy. Hints to Exercises. Bibliography. Indexes.

Read more less

Book SynopsisMinimal prerequisites make this text ideal for a first course in number theory. Written in a lively, engaging style by the author of popular mathematics books, it features nearly 1,000 imaginative exercises and problems. Solutions to many of the problems are included, and a teacher''s guide is available. 1978 edition.

Read more less

Book SynopsisThis 2003 undergraduate-level introduction describes those mathematical properties of prime numbers that can be deduced with the tools of calculus. The capstone of the book is a brief presentation of the Riemann zeta function and of the significance of the Riemann Hypothesis.Trade Review'… excellent background reading for undergraduates at any stage of their course.' Zentralblatt für Mathematik'… this is a well-written book at the level of senior undergraduates.' Society for Industrial and Applied Mathematics'The book constitutes an excellent undergraduate introduction to classical analytical number theory. The author develops the subject from the very beginning in an extremely good and readable style. Although a wide variety of topics are presented in the book, the author has successfully placed a rich historical background to each of the discussed themes, which makes the text very lively … the text contains a rich supplement of exercises, brief sketches of more advanced ideas and extensive graphical support. The book can be recommended as a very good first introductory reading for all those who are seriously interested in analytical number theory.' EMS Newsletter'… a very readable account.' Mathematika'The general style is user-friendly and interactive … a well presented and stimulating informal introduction to a wide range of topics …'. Proceedings of the Edinburgh Mathematical SocietyTable of Contents1. Sums and differences; 2. Products and divisibility; 3. Order and magnitude; 4. Counterexamples; 5. Averages; 6. Prime number theorems; 7. Series; 8. The Basel problem; 9. Euler's product; 10. The Riemann zeta function; 11. Pell's equation; 12. Elliptic curves; 13. Symmetry; 14. Explicit formula.

Read more less

Book SynopsisThis stimulating introduction to zeta (and related) functions of graphs develops the fruitful analogy between combinatorics and number theory - for example, the Riemann hypothesis for graphs - making connections with quantum chaos, random matrix theory, and computer science. Many well-chosen illustrations and exercises, both theoretical and computer-based, are included throughout.Trade Review'The book is very appealing through its informal style and the variety of topics covered and may be considered the standard reference book in this field.' Zentralblatt MATHTable of ContentsList of illustrations; Preface; Part I. A Quick Look at Various Zeta Functions: 1. Riemann's zeta function and other zetas from number theory; 2. Ihara's zeta function; 3. Selberg's zeta function; 4. Ruelle's zeta function; 5. Chaos; Part II. Ihara's Zeta Function and the Graph Theory Prime Number Theorem: 6. Ihara zeta function of a weighted graph; 7. Regular graphs, location of poles of zeta, functional equations; 8. Irregular graphs: what is the RH?; 9. Discussion of regular Ramanujan graphs; 10. The graph theory prime number theorem; Part III. Edge and Path Zeta Functions: 11. The edge zeta function; 12. Path zeta functions; Part IV. Finite Unramified Galois Coverings of Connected Graphs: 13. Finite unramified coverings and Galois groups; 14. Fundamental theorem of Galois theory; 15. Behavior of primes in coverings; 16. Frobenius automorphisms; 17. How to construct intermediate coverings using the Frobenius automorphism; 18. Artin L-functions; 19. Edge Artin L-functions; 20. Path Artin L-functions; 21. Non-isomorphic regular graphs without loops or multiedges having the same Ihara zeta function; 22. The Chebotarev Density Theorem; 23. Siegel poles; Part V. Last Look at the Garden: 24. An application to error-correcting codes; 25. Explicit formulas; 26. Again chaos; 27. Final research problems; References; Index.

Read more less

Book SynopsisThis book is, on the one hand, a pedagogical introduction to the formalism of slopes, of semi-stability and of related concepts in the simplest possible context. It is therefore accessible to any graduate student with a basic knowledge in algebraic geometry and algebraic groups. On the other hand, the book also provides a thorough introduction to the basics of period domains, as they appear in the geometric approach to local Langlands correspondences and in the recent conjectural p-adic local Langlands program. The authors provide numerous worked examples and establish many connections to topics in the general area of algebraic groups over finite and local fields. In addition, the end of each section includes remarks on open questions, historical context and references to the literature.Trade Review'This monograph is a systematic treatise on period domains over finite and over p-adic fields. It presents the theory as it has developed over the past fifteen years … The book should serve as the basis of future research in this area.' Zentralblatt MATHTable of ContentsPreface; Introduction; Part I. Period Domains for GLn Over a Finite Field: 1. Filtered vector spaces; 2. Period domains for GLn; 3. Cohomology of period domains for GLn; Part II. Period Domains for Reductive Groups over Finite Fields: 4. Interlude on the Tannakian formalism; 5. Filtrations on repk(G); 6. Period domains for reductive groups; 7. Cohomology of period domains for reductive groups; Part III. Period Domains over p-adic Fields: 8. Period domains over p-adic fields; 9. Period domains for p-adic reductive groups; 10. Cohomology of period domains over p-adic fields; Part IV. Complements: 11. Further aspects of period domains; References; Index.

Read more less

Book SynopsisIn this volume, originally published in 1990, are included papers presented at two meetings; one a workshop on Number Theory and Cryptography, and the other, the annual meeting of the Australian Mathematical Society. Questions in number theory are of military and commercial importance for the security of communication, as they are related to codes and code-breaking. Papers in the volume range from problems in pure mathematics whose study has been intensified by this connection, through interesting theoretical and combinatorial problems which arise in the implementation, to practical questions that come from banking and telecommunications. The contributors are prominent within their field. The whole volume will be an attractive purchase for all number theorists, 'pure' or 'applied'.Table of ContentsList of contributors; Introduction; Part I. Number Theoretic Aspects of Cryptology: 1. Some mathematical aspects of recent advances in cryptology R. Lidl; 2. Quadratic fields and cryptography J. Buchmann and H. C. Williams; 3. Parallel algorithms for integer factorisation R. P. Brent; 4. An open architecture number sieve A. J. Stephens and H. C. Williams; 5. Algorithms for finite fields H. W. Lenstra, Jr.; 6. Notes on continued fractions and recurrence sequences A. J. Van der Poorten; Part II. Cryptographic Devices and Applications: 7. Security in telecommunication services over the next decade J. Snare; 8. Linear feedback shift registers and stream ciphers E. Dawson; 9. Applying randomness tests to commercial level block ciphers H. Gustaphson, E. Dawson and W. Caelli; 10. Pseudo-random sequence generators using structures noise R. S. Safavi-Naini and J. R. Seberry; 11. Privacy for MANCET M. Warner; 12. Authentication B. Newman; 13. Insecurity of the knapsack one-time pad R. T. Worley; 14. The tactical frequency management problem: heuristic search and simulated annealing L. Peters; 15. Reed–Solomon coding in the complex field M. Rudolph; Part III. Diophantine Analysis: 16. Class number problems for real quadratic fields R. A. Mollin and H. C. Williams; 17. Number theoretic problems involving two independent bases T. Kamae; 18. A class of normal numbers II. Y. -N. Nakai and I. Shiokawa; 19. Notes on uniform distribution G. Myerson and A. Pollington; 20. Thue equations and multiplicative independence B. Brizinda; 21. A number theoretic crank associated with open bosonic strings F. G. Garvan; 22. Universal families of abelian varieties A. Silverberg.

Read more less

Book SynopsisThe study of (special cases of) elliptic curves goes back to Diophantos and Fermat, and today it is still one of the liveliest centres of research in number theory. This book, which is addressed to beginning graduate students, introduces basic theory from a contemporary viewpoint but with an eye to the historical background. The central portion deals with curves over the rationals: the Mordell-Weil finite basis theorem, points of finite order (Nagell-Lutz) etc. The treatment is structured by the local-global standpoint and culminates in the description of the Tate-Shafarevich group as the obstruction to a Hasse principle. In an introductory section the Hasse principle for conics is discussed. The book closes with sections on the theory over finite fields (the 'Riemann hypothesis for function fields') and recently developed uses of elliptic curves for factoring large integers. Prerequisites are kept to a minimum; an acquaintance with the fundamentals of Galois theory is assumed, but no Trade Review'… an excellent introduction … written with humour.' Monatshefte für MathematikTable of ContentsIntroduction; 1. Curves of genus: introduction; 2. p-adic numbers; 3. The local-global principle for conics; 4. Geometry of numbers; 5. Local-global principle: conclusion of proof; 6. Cubic curves; 7. Non-singular cubics: the group law; 8. Elliptic curves: canonical form; 9. Degenerate laws; 10. Reduction; 11. The p-adic case; 12. Global torsion; 13. Finite basis theorem: strategy and comments; 14. A 2-isogeny; 15. The weak finite basis theorem; 16. Remedial mathematics: resultants; 17. Heights: finite basis theorem; 18. Local-global for genus principle; 19. Elements of Galois cohomology; 20. Construction of the jacobian; 21. Some abstract nonsense; 22. Principle homogeneous spaces and Galois cohomology; 23. The Tate-Shafarevich group; 24. The endomorphism ring; 25. Points over finite fields; 26. Factorizing using elliptic curves; Formulary; Further reading; Index.

Read more less

Book SynopsisThis graduate-level textbook provides an elementary exposition of the theory of automorphic representations and L-functions for the general linear group in an adelic setting. Definitions are kept to a minimum and repeated when reintroduced so that the book is accessible from any entry point, and with no prior knowledge of representation theory. The book includes concrete examples of global and local representations of GL(n), and presents their associated L-functions. In Volume 1, the theory is developed from first principles for GL(1), then carefully extended to GL(2) with complete detailed proofs of key theorems. Several proofs are presented for the first time, including Jacquet's simple and elegant proof of the tensor product theorem. In Volume 2, the higher rank situation of GL(n) is given a detailed treatment. Containing numerous exercises by Xander Faber, this book will motivate students and researchers to begin working in this fertile field of research.Trade Review'In this book, the authors give a thorough yet elementary introduction to the theory of automorphic forms and L-functions for the general linear group of rank two over rational adeles … The exposition is accompanied by exercises after every chapter. Definitions are repeated when needed, and previous results are always cited, so the book is very accessible.' Marcela Hanzer, Zentralblatt MATHTable of ContentsPreface; 1. Adeles over Q; 2. Automorphic representations and L-functions for GL(1,AQ); 3. The classical theory of automorphic forms for GL(2); 4. Automorphic forms for GL(2,AQ); 5. Automorphic representations for GL(2,AQ); 6. Theory of admissible representations of GL(2,Qp); 7. Theory of admissible (g,K∞) modules for GL(2,R); 8. The contragredient representation for GL(2); 9. Unitary representations of GL(2); 10. Tensor products of local representations; 11. The Godement–Jacquet L-function for GL(2,AQ); Solutions to selected exercises; References; Symbols index; Index.

Read more less

Book SynopsisThis introductory book emphasizes algorithms and applications, and is accessible to a broad audience. The author alternates between theory and applications in order to illustrate the mathematics. This second edition includes many new exercises and worked examples, and has been reorganized to improve presentation and clarity of exposition.Trade Review'The subject matter is presented in a very thorough way … The material is very well organized: definitions, results and their interrelations fit together perfectly … The book is especially attractive to students with a background or interest in computer science … The suitability of the book for self-study is greatly enhanced by a wealth of exercises and examples that are provided … the book is very well-written, and it is a pleasure to read.' Mathematics of Computation'… the book could serve as a course of discrete mathematics for computer science students.' EMS NewsletterTable of ContentsPreface; Preliminaries; 1. Basic properties of the integers; 2. Congruences; 3. Computing with large integers; 4. Euclid's algorithm; 5. The distribution of primes; 6. Abelian groups; 7. Rings; 8. Finite and discrete probability distributions; 9. Probabilistic algorithms; 10. Probabilistic primality testing; 11. Finding generators and discrete logarithms in Z*p; 12. Quadratic reciprocity and computing modular square roots; 13. Modules and vector spaces; 14. Matrices; 15. Subexponential-time discrete logarithms and factoring; 16. More rings; 17. Polynomial arithmetic and applications; 18. Linearly generated sequences and applications; 19. Finite fields; 20. Algorithms for finite fields; 21. Deterministic primality testing; Appendix: some useful facts; Bibliography; Index of notation; Index.

Read more less

Book SynopsisThis text is a self contained treatment of expander graphs and in particular their explicit construction. Expander graphs are both highly connected but sparse, and besides their interest within combinatorics and graph theory, they also find various applications in computer science and engineering.Trade Review'The book under review is an attractively written excellent text which successfully bridges the gap between undergraduate instruction and current research. Hence it is very well suited to bring a fresh breeze into the classroom. The reviewer warmly recommends this text to any lecturer looking for an attractive theme and to everybody else for great supplementary reading. Of course, this book should not be missed in any institutional library.' Zentralblatt MATH'A light touch and the inclusion of some unexpected results make the book a pleasure to read.' MathematikaTable of ContentsAn overview; 1. Graph theory; 2. Number theory; 3. PSL2(q); 4. The graphs Xp,q; Appendix A. 4-regular graphs with large girth; Index; Bibliography.

Read more less

Book SynopsisDedekind memoir 'Sur la Theorie des Nombres Entiers Algebriques' first appeared in installments in French in 1877. This is a translation of that work by John Stillwell, who also adds a detailed introduction that gives the historical background as well as outlining the mathematical obstructions that Dedekind was striving to overcome.Trade Review"The book has historical interest in providing a very clear glimpse of the origins of modern algebra and algebraic number theory, but it also has considerable mathematical interest. It is truly astonishing that a text written one hundred and twenty years ago, well before modern algebraic terminology and concepts were introduced and accepted, can provide a plausible introduction to algebraic number theory for a student today." Mathematical Reviews Clippings 98hTable of ContentsPart I. Translator's Introduction: 1. General remarks; 2. Squares; 3. Quadratic forms; 4. Quadratic integers; 5. Roots of unity; 6. Algebraic integers; 7. The reception of ideal theory; Part II. Theory of Algebraic Integers: 8. Auxiliary theorems from the theory of modules; 9. Germ of the theory of ideals; 10. General properties of algebraic integers; 11. Elements of the theory of ideals.

Read more less