The minimal background requirements and the author's fresh approach make this book enjoyable and accessible to a wide range of students, mathematicians, and fans of number theory."--BOOK JACKET.

While its roots reach back to the third century, diophantine analysis continues to be an extremely active and powerful area of number theory. Many diophantine problems have simple formulations, they can be extremely difficult to attack, and many open problems and conjectures remain. Diophantine Analysis examines the theory of diophantine ap

Abstract:

We learn by doing. We learn mathematics by doing problems. And we learn more mathematics by doing more problems. This is the sequel to Problems in Mathematical Analysis I (Volume 4 in the Student Mathematical Library series). If you want to hone your understanding of continuous and differentiable functions, this book contains hundreds of problems to help you do so. The emphasis here is on real functions of a single variable. The book is mainly geared toward students studying the basic principles of analysis. However, given its selection of problems, organization, and level, it would be an ideal choice for tutorial or problem-solving seminars, particularly those geared toward the Putnam exam. It is also suitable for self-study. The presentation of the material is designed to help student comprehension, to encourage them to ask their own questions, and to start research. The collection of problems will also help teachers who wish to incorporate problems into their lectures. The problems are grouped into sections according to the methods of solution. Solutions for the problems are provided.

In a manner accessible to beginning undergraduates, An Invitation to Modern Number Theory introduces many of the central problems, conjectures, results, and techniques of the field, such as the Riemann Hypothesis, Roth's Theorem, the Circle Method, and Random Matrix Theory. Showing how experiments are used to test conjectures and prove theorems, the book allows students to do original work on such problems, often using little more than calculus (though there are numerous remarks for those with deeper backgrounds). It shows students what number theory theorems are used for and what led to them and suggests problems for further research. Steven Miller and Ramin Takloo-Bighash introduce the problems and the computational skills required to numerically investigate them, providing background material (from probability to statistics to Fourier analysis) whenever necessary. They guide students through a variety of problems, ranging from basic number theory, cryptography, and Goldbach's Problem, to the algebraic structures of numbers and continued fractions, showing connections between these subjects and encouraging students to study them further. In addition, this is the first undergraduate book to explore Random Matrix Theory, which has recently become a powerful tool for predicting answers in number theory. Providing exercises, references to the background literature, and Web links to previous student research projects, An Invitation to Modern Number Theory can be used to teach a research seminar or a lecture class.

The book gives an introduction to $p$-adic numbers from the point of view of number theory, topology, and analysis. Compared to other books on the subject, its novelty is both a particularly balanced approach to these three points of view and an emphasis on topics accessible to undergraduates. in addition, several topics from real analysis and elementary topology which are not usually covered in undergraduate courses (totally disconnected spaces and Cantor sets, points of discontinuity of maps and the Baire Category Theorem, surjectivity of isometries of compact metric spaces) are also included in the book. They will enhance the reader's understanding of real analysis and intertwine the real and $p$-adic contexts of the book. The book is based on an advanced undergraduate course given by the author. The choice of the topic was motivated by the internal beauty of the subject of $p$-adic analysis, an unusual one in the undergraduate curriculum, and abundant opportunities to compare it with its much more familiar real counterpart. The book includes a large number of exercises. Answers, hints, and solutions for most of them appear at the end of the book. Well written, with obvious care for the reader, the book can be successfully used in a topic course or for self-study.

Fill in any gaps in your knowledge with this overview of key topics in undergraduate mathematics, now with four new chapters.

This book takes the reader on a mathematical journey, from a number-theoretic point of view, to the realm of Markov’s theorem and the uniqueness conjecture, gradually unfolding many beautiful connections until everything falls into place in the proof of Markov’s theorem. What makes the Markov theme so attractive is that it appears in an astounding variety of different fields, from number theory to combinatorics, from classical groups and geometry to the world of graphs and words. On the way, there are also introductory forays into some fascinating topics that do not belong to the standard curriculum, such as Farey fractions, modular and free groups, hyperbolic planes, and algebraic words. The book closes with a discussion of the current state of knowledge about the uniqueness conjecture, which remains an open challenge to this day. All the material should be accessible to upper-level undergraduates with some background in number theory, and anything beyond this level is fully explained in the text. This is not a monograph in the usual sense concentrating on a specific topic. Instead, it narrates in five parts – Numbers, Trees, Groups, Words, Finale – the story of a discovery in one field and its many manifestations in others, as a tribute to a great mathematical achievement and as an intellectual pleasure, contemplating the marvellous unity of all mathematics.

This book constitutes the refereed proceedings of the 5th International Conference on Artificial Immune Systems, ICARIS 2006. The book presents 34 revised full papers, are organized in topical sections on computer simulation of classical immunology, computer simulation of idiotypic network, immunoinformatics conceptual papers, pattern recognition type of application, optimization type of application, control and time-series type of application, danger theory inspired application, and text mining application.

In combinatorics, one often considers the process of enumerating objects of a certain nature, which results in a sequence of positive integers. With each such sequence, one can associate a generating function, whose properties tell us a lot about the nature of the objects being enumerated. Nowadays, the language of generating functions is the main language of enumerative combinatorics. This book is based on the course given by the author at the College of Mathematics of the Independent University of Moscow. It starts with definitions, simple properties, and numerous examples of generating functions. It then discusses various topics, such as formal grammars, generating functions in several variables, partitions and decompositions, and the exclusion-inclusion principle. In the final chapter, the author describes applications of generating functions to enumeration of trees, plane graphs, and graphs embedded in two-dimensional surfaces. Throughout the book, the reader is motivated by interesting examples rather than by general theories. It also contains a lot of exercises to help the reader master the material. Little beyond the standard calculus course is necessary to understand the book. It can serve as a text for a one-semester undergraduate course in combinatorics.