The classical fields are the real, rational, complex and p-adic numbers. Each of these fields comprises several intimately interwoven algebraical and topological structures. This comprehensive volume analyzes the interaction and interdependencies of these different aspects. The real and rational numbers are examined additionally with respect to their orderings, and these fields are compared to their non-standard counterparts. Typical substructures and quotients, relevant automorphism groups and many counterexamples are described. Also discussed are completion procedures of chains and of ordered and topological groups, with applications to classical fields. The p-adic numbers are placed in the context of general topological fields: absolute values, valuations and the corresponding topologies are studied, and the classification of all locally compact fields and skew fields is presented. Exercises are provided with hints and solutions at the end of the book. An appendix reviews ordinals and cardinals, duality theory of locally compact Abelian groups and various constructions of fields.

This graduate text, based on years of teaching experience, is intended for first or second year graduate students in pure mathematics. The main goal of the text is to show how the computer can be used as a tool for research in number theory through numerical experimentation. The book contains many examples of experiments in binary quadratic forms, zeta functions of varieties over finite fields, elementary class field theory, elliptic units, modular forms, along with exercises and selected solutions. Sample programs are written in GP, the scripting language for the computational package PARI, and are available for download from the author's website.

This book presents a historical overview of number theory. It examines texts that span some thirty-six centuries of arithmetical work, from an Old Babylonian tablet to Legendre's Essai sur la Theorie des Nombres, written in 1798. Coverage employs a historical approach in the analysis of problems and evolving methods of number theory and their significance within mathematics. The book also takes the reader into the workshops of four major authors of modern number theory: Fermat, Euler, Lagrange and Legendre and presents a detailed and critical examination of their work.

In Single Digits, Marc Chamberland takes readers on a fascinating exploration of small numbers, from one to nine, looking at their history, applications, and connections to various areas of mathematics, including number theory, geometry, chaos theory, numerical analysis, and mathematical physics. For instance, why do eight perfect card shuffles leave a standard deck of cards unchanged? And, are there really "six degrees of separation" between all pairs of people? Chamberland explores these questions and covers vast numerical territory, such as illustrating the ways that the number three connects to chaos theory, the number of guards needed to protect an art gallery, problematic election results and so much more. The book's short sections can be read independently and digested in bite-sized chunks--especially good for learning about the Ham Sandwich Theorem and the Pizza Theorem. Appealing to high school and college students, professional mathematicians, and those mesmerized by patterns, this book shows that single digits offer a plethora of possibilities that readers can count on.

An update of the most accessible introductory number theory text available, Fundamental Number Theory with Applications, Second Edition presents a mathematically rigorous yet easy-to-follow treatment of the fundamentals and applications of the subject. The substantial amount of reorganizing makes this edition clearer and more elementary in its coverage. New to the Second Edition * Removal of all advanced material to be even more accessible in scope * New fundamental material, including partition theory, generating functions, and combinatorial number theory * Expanded coverage of random number generation, Diophantine analysis, and additive number theory * More applications to cryptography, primality testing, and factoring * An appendix on the recently discovered unconditional deterministic polynomial-time algorithm for primality testing Taking a truly elementary approach to number theory, this text supplies the essential material for a first course on the subject. Placed in highlighted boxes to reduce distraction from the main text, nearly 70 biographies focus on major contributors to the field. The presentation of over 1,300 entries in the index maximizes cross-referencing so students can find data with ease.

Hex: The Full Story is for anyone - hobbyist, professional, student, teacher - who enjoys board games, game theory, discrete math, computing, or history. hex was discovered twice, in 1942 by Piet Hein and again in 1949 by John F. nash. How did this happen? Who created the puzzle for Hein's Danish newspaper column? How are Martin Gardner, David Gale, Claude Shannon, and Claude Berge involved? What is the secret to playing Hex well? The answers are inside... Features New documents on Hein's creation of Hex, the complete set of Danish puzzles, and the identity of their composer Chapters on Gale's game Bridg-it, the game Rex, computer Hex, open Hex problems, and more Dozens of new puzzles and solutions Study guide for Hex players Supplemenetary text for a course in game theory, discrete math, computer science, or science history

This challenging problem book by renowned US Olympiad coaches, mathematics teachers, and researchers develops a multitude of problem-solving skills needed to excel in mathematical contests and in mathematical research in number theory. Offering inspiration and intellectual delight, the problems throughout the book encourage students to express their ideas in writing to explain how they conceive problems, what conjectures they make, and what conclusions they reach. Applying specific techniques and strategies, readers will acquire a solid understanding of the fundamental concepts and ideas of number theory.

Explore the main algebraic structures and number systems that play a central role across the field of mathematics

Algebra and number theory are two powerful branches of modern mathematics at the forefront of current mathematical research, and each plays an increasingly significant role in different branches of mathematics, from geometry and topology to computing and communications. Based on the authors' extensive experience within the field, "Algebra and Number Theory" has an innovative approach that integrates three disciplines--linear algebra, abstract algebra, and number theory--into one comprehensive and fluid presentation, facilitating a deeper understanding of the topic and improving readers' retention of the main concepts.

The book begins with an introduction to the elements of set theory. Next, the authors discuss matrices, determinants, and elements of field theory, including preliminary information related to integers and complex numbers. Subsequent chapters explore key ideas relating to linear algebra such as vector spaces, linear mapping, and bilinear forms. The book explores the development of the main ideas of algebraic structures and concludes with applications of algebraic ideas to number theory.

Interesting applications are provided throughout to demonstrate the relevance of the discussed concepts. In addition, chapter exercises allow readers to test their comprehension of the presented material.

"Algebra and Number Theory" is an excellent book for courses on linear algebra, abstract algebra, and number theory at the upper-undergraduate level. It is also a valuable reference for researchers working in different fields of mathematics, computer science, and engineering as well as for individuals preparing for a career in mathematics education.

This book constitutes the refereed proceedings of the 5th International Workshop on Ant Colony Optimization and Swarm Intelligence, ANTS 2006, held in Brussels, Belgium, in September 2006.

The 27 revised full papers, 23 revised short papers, and 12 extended abstracts presented were carefully reviewed and selected from 115 submissions. The papers are devoted to theoretical and foundational aspects of ant algorithms, evolutionary optimization, ant colony optimization, and swarm intelligence and deal with a broad variety of optimization applications in networking, operations research, multiagent systems, robot systems, networking, etc.

Yearning for the Impossible: The Surprising Truth of Mathematics, Second Edition explores the history of mathematics from the perspective of the creative tension between common sense and the "impossible" as the author follows the discovery or invention of new concepts that have marked mathematical progress. The author puts these creations into a broader context involving related "impossibilities" from art, literature, philosophy, and physics. This new edition contains many new exercises and commentaries, clearly discussing a wide range of challenging subjects.

Growing out of a course designed to teach Gauss's Disquisitiones Arithmeticae to honors-level undergraduates, Flath's Introduction to Number Theory focuses on Gauss's theory of binary quadratic forms. It is suitable for use as a textbook in a course or self-study by advanced undergraduates or graduate students who possess a basic familiarity with abstract algebra. The text treats a variety of topics from elementary number theory including the distribution of primes, sums of squares, continued factions, the Legendre, Jacobi and Kronecker symbols, the class group and genera. But the focus is on quadratic reciprocity (several proofs are given including one that highlights the $p - q$ symmetry) and binary quadratic forms. The reader will come away with a good understanding of what Gauss intended in the Disquisitiones and Dirichlet in his Vorlesungen. The text also includes a lovely appendix by J. P. Serre titled $\Delta = b^2 - 4ac$. The clarity of the author's vision is matched by the clarity of his exposition. This is a book that reveals the discovery of the quadratic core of algebraic number theory. It should be on the desk of every instructor of introductory number theory as a source of inspiration, motivation, examples, and historical insight.

This book constitutes the refereed proceedings of the 7th International Algorithmic Number Theory Symposium, ANTS 2006, held in Berlin, July 2006. The book presents 37 revised full papers together with 4 invited papers selected for inclusion. The papers are organized in topical sections on algebraic number theory, analytic and elementary number theory, lattices, curves and varieties over fields of characteristic zero, curves over finite fields and applications, and discrete logarithms.

Leibniz Algebras: Structure and Classification is designed to introduce the reader to the theory of Leibniz algebras. Leibniz algebra is the generalization of Lie algebras. These algebras preserve a unique property of Lie algebras that the right multiplication operators are derivations. They first appeared in papers of A.M Blokh in the 1960s, under the name D-algebras, emphasizing their close relationship with derivations. The theory of D-algebras did not get as thorough an examination as it deserved immediately after its introduction. Later, the same algebras were introduced in 1993 by Jean-Louis Loday , who called them Leibniz algebras due to the identity they satisfy. The main motivation for the introduction of Leibniz algebras was to study the periodicity phenomena in algebraic K-theory. Nowadays, the theory of Leibniz algebras is one of the more actively developing areas of modern algebra. Along with (co)homological, structural and classification results on Leibniz algebras, some papers with various applications of the Leibniz algebras also appear now. However, the focus of this book is mainly on the classification problems of Leibniz algebras. Particularly, the authors propose a method of classification of a subclass of Leibniz algebras based on algebraic invariants. The method is applicable in the Lie algebras case as well. Features: Provides a systematic exposition of the theory of Leibniz algebras and recent results on Leibniz algebras Suitable for final year bachelor's students, master's students and PhD students going into research in the structural theory of finite-dimensional algebras, particularly, Lie and Leibniz algebras Covers important and more general parts of the structural theory of Leibniz algebras that are not addressed in other texts

Devised 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. Though the main focus is on Gauss and Jacobi, the book does explore other relevant formulas, including Cauchy.

This volume contains the proceedings of the 7th International Seminar on - lational Methods in Computer Science (RelMiCS 7) and the 2nd International Workshop onApplications ofKleeneAlgebra.Thecommonmeetingtookplacein Bad Malente (near Kiel), Germany, from May May 12-17,2003.Its purpose was to bring together researchers from various subdisciplines of Computer Science, Mathematics and related ?elds who use the calculi of relations and/or Kleene algebra as methodological and conceptual tools in their work. This meeting is the joint continuation of two di?erent series of meetings. Previous RelMiCS seminars were held in Schloss Dagstuhl (Germany) in J- uary 1994, Parati (Brazil) in July 1995, Hammamet (Tunisia) in January 1997, Warsaw (Poland) in September 1998, Quebec (Canada) in January 2000, and Oisterwijk (The Netherlands) in October 2001. The ?rst workshop on appli- tions of Kleene algebra was also held in Schloss Dagstuhl in February 2001. To join these two events in a common meeting was mainly motivated by the s- stantialcommoninterestsandoverlapofthetwocommunities.Wehopethatthis leads to fruitful interactions and opens new and interesting research directions

These lecture notes treat polynomial identity rings from both the combinatorial and structural points of view. The greater part of recent research in polynomial identity rings is about combinatorial questions, and the combinatorial part of the lecture notes gives an up-to-date account of recent research. On the other hand, the main structural results have been known for some time, and the emphasis there is on a presentation accessible to newcomers to the subject.

A fascinating journey into the mind-bending world of prime numbers
Cicadas of the genus Magicicada appear once every 7, 13, or 17 years. Is it just a coincidence that these are all prime numbers? How do twin primes differ from cousin primes, and what on earth (or in the mind of a mathematician) could be sexy about prime numbers? What did Albert Wilansky find so fascinating about his brother-in-law's phone number?
Mathematicians have been asking questions about prime numbers for more than twenty-five centuries, and every answer seems to generate a new rash of questions. In Prime Numbers: The Most Mysterious Figures in Math, you'll meet the world's most gifted mathematicians, from Pythagoras and Euclid to Fermat, Gauss, and Erd?o?s, and you'll discover a host of unique insights and inventive conjectures that have both enlarged our understanding and deepened the mystique of prime numbers. This comprehensive, A-to-Z guide covers everything you ever wanted to know--and much more that you never suspected--about prime numbers, including:
* The unproven Riemann hypothesis and the power of the zeta function
* The ""Primes is in P"" algorithm
* The sieve of Eratosthenes of Cyrene
* Fermat and Fibonacci numbers
* The Great Internet Mersenne Prime Search
* And much, much more

A 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 Tóth, Rogers, and Erd???s. Nearly half the results presented in this book were discovered over the past twenty years, and most have never before appeared in any monograph. Combinatorial Geometry will be of particular interest to mathematicians, computer scientists, physicists, and materials scientists interested in computational geometry, robotics, scene analysis, and computer-aided design. It is also a superb textbook, complete with end-of-chapter problems and hints to their solutions that help students clarify their understanding and test their mastery of the material. Topics covered include:

• Geometric number theory
• Packing and covering with congruent convex disks
• Extremal graph and hypergraph theory
• Distribution of distances among finitely many points
• Epsilon-nets and Vapnik—Chervonenkis dimension
• Geometric graph theory
• Geometric discrepancy theory
• And much more

This book presents material suitable for an undergraduate course in elementary number theory from a computational perspective. It seeks to not only introduce students to the standard topics in elementary number theory, such as prime factorization and modular arithmetic, but also to develop their ability to formulate and test precise conjectures from experimental data. Each topic is motivated by a question to be answered, followed by some experimental data, and, finally, the statement and proof of a theorem. There are numerous opportunities throughout the chapters and exercises for the students to engage in (guided) open-ended exploration. At the end of a course using this book, the students will understand how mathematics is developed from asking questions to gathering data to formulating and proving theorems. The mathematical prerequisites for this book are few. Early chapters contain topics such as integer divisibility, modular arithmetic, and applications to cryptography, while later chapters contain more specialized topics, such as Diophantine approximation, number theory of dynamical systems, and number theory with polynomials. Students of all levels will be drawn in by the patterns and relationships of number theory uncovered through data driven exploration.

This book, now in its 2nd edition, is devoted to the arithmetical theory of Siegel modular forms and their L-functions. The central object are L-functions of classical Siegel modular forms whose special values are studied using the Rankin-Selberg method and the action of certain differential operators on modular forms which have nice arithmetical properties.

A new method of p-adic interpolation of these critical values is presented. An important class of p-adic L-functions treated in the present book are p-adic L-functions of Siegel modular forms having logarithmic growth. The given construction of these p-adic L-functions uses precise algebraic properties of the arithmetical Shimura differential operator.

The book will be very useful for postgraduate students and for non-experts looking for a quick approach to a rapidly developing domain of algebraic number theory. This new edition is substantially revised to account for the new explanations that have emerged in the past 10 years of the main formulas for special L-values in terms of arithmetical theory of nearly holomorphic modular forms.

Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations. The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book are designed so that even those high school students and teachers who are interested in combinatorics can have the benefit of them. Still, the book collects vast, up-to-date information for many counting sequences (especially, related to set partitions and permutations), so it is a must-have piece for those mathematicians who do research on enumerative combinatorics. In addition, the book contains number theoretical results on counting sequences of set partitions and permutations, so number theorists who would like to see nice applications of their area of interest in combinatorics will enjoy the book, too. Features The Outlook sections at the end of each chapter guide the reader towards topics not covered in the book, and many of the Outlook items point towards new research problems. An extensive bibliography and tables at the end make the book usable as a standard reference. Citations to results which were scattered in the literature now become easy, because huge parts of the book (especially in parts II and III) appear in book form for the first time.

The sixth Algorithmic Number Theory Symposium was held at the University of Vermont, in Burlington, from 13-18 June 2004. The organization was a joint e?ort of number theorists from around the world. There were four invited talks at ANTS VI, by Dan Bernstein of the Univ- sity of Illinois at Chicago, Kiran Kedlaya of MIT, Alice Silverberg of Ohio State University, and Mark Watkins of Pennsylvania State University. Thirty cont- buted talks were presented, and a poster session was held. This volume contains the written versions of the contributed talks and three of the four invited talks. (Not included is the talk by Dan Bernstein.) ANTS in Burlington is the sixth in a series that began with ANTS I in 1994 at Cornell University, Ithaca, New York, USA and continued at UniversiteB- deaux I, Bordeaux, France (1996), Reed College, Portland, Oregon, USA (1998), the University of Leiden, Leiden, The Netherlands (2000), and the University of Sydney, Sydney, Australia (2002). The proceedings have been published as volumes 877, 1122, 1423, 1838, and 2369 of Springer-Verlag's Lecture Notes in Computer Science series. The organizers of the 2004 ANTS conference express their special gratitude and thanks to John Cannon and Joe Buhler for invaluable behind-the-scenes advice."

The 13 chapters of this book centre around the proof of Theorem 1 of Faltings' paper "Diophantine approximation on abelian varieties," Ann. Math.133 (1991) and together give an approach to the proof that is accessible to Ph.D-level students in number theory and algebraic geometry. Each chapter is based on an instructional lecture given by its author ata special conference for graduate students, on the topic of Faltings' paper.

This book constitutes the refereed proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2003, held in Rome, Italy in September 2003. The 20 revised full papers presented were carefully reviewed and selected for inclusion in the book. All current issues surrounding the mechanization of logical reasoning with tableaux and similar methods are addressed in the context of a broad variety of logic calculi.

Since their discovery hundreds of years ago, people have been fascinated by the wondrous properties of Fibonacci numbers. Being of mathematical significance in their own right, Fibonacci numbers have had an impact on areas like art and architecture, and their traces can be found in nature and even the behavior of the stock market. Starting with the basic properties of Fibonacci numbers, the present book explores their relevance in number theory, the theory of continued fractions, geometry and approximation theory. Rather than giving a complete account of the subject, a few chosen examples are treated exhaustively. They not only reveal the bearing of Fibonacci numbers on mathematics, but also provide very readable marvels of mathematical reasoning. This book is the translation of the 6th Russian edition (the first edition appeared in the early fifties and became a standard source of information on the subject).