A Set Of Sequences In Number Theory

New sequences are introduced in number theory, and for each one a general question: how many primes each sequence has.

This collaborative book presents recent trends on the study of sequences, including combinatorics on words and symbolic dynamics, and new interdisciplinary links to group theory and number theory. Other chapters branch out from those areas into subfields of theoretical computer science, such as complexity theory and theory of automata. The book is built around four general themes: number theory and sequences, word combinatorics, normal numbers, and group theory. Those topics are rounded out by investigations into automatic and regular sequences, tilings and theory of computation, discrete dynamical systems, ergodic theory, numeration systems, automaton semigroups, and amenable groups. This volume is intended for use by graduate students or research mathematicians, as well as computer scientists who are working in automata theory and formal language theory. With its organization around unified themes, it would also be appropriate as a supplemental text for graduate level courses.

Number and geometry are the foundations upon which mathematics has been built over some 3000 years. This book is concerned with the logical foundations of number systems from integers to complex numbers. The author has chosen to develop the ideas by illustrating the techniques used throughout mathematics rather than using a self-contained logical treatise. The idea of proof has been emphasised, as has the illustration of concepts from a graphical, numerical and algebraic point of view. Having laid the foundations of the number system, the author has then turned to the analysis of infinite processes involving sequences and series of numbers, including power series. The book also has worked examples throughout and includes some suggestions for self-study projects. In addition there are tutorial problems aimed at stimulating group work and discussion.

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.

Note: This is a custom edition of Levin's full Discrete Mathematics text, arranged specifically for use in a discrete math course for future elementary and middle school teachers. (It is NOT a new and updated edition of the main text.)This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this.Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs.While there are many fine discrete math textbooks available, this text has the following advantages: - It is written to be used in an inquiry rich course.- It is written to be used in a course for future math teachers.- It is open source, with low cost print editions and free electronic editions.

THIS volume is concerned with a substantial branch of number theory of which no connected account appears to exist; we describe the general nature of the constituent topics in the introduction. Although some excellent surveys dealing with limited aspects of the subject under con sideration have been published, the literature as a whole is far from easy to study. This is due in part to the extent of the literature; it is necessary to thread one's way through a maze of results, a complicated structure of inter-relationships, and many conflicting notations. In addition, however, not all the original papers are free from obscurities, and consequently some of these papers are difficult (a few even exceed ingly difficult) to master. We try to give a readable and coherent account of the subject, con taining a cross-section of the more interesting results. We felt that it would have been neither practicable nor desirable to attempt a compre hensive account; we treat each aspect of the subject from some special point of view, and select results accordingly. Needless to say, this approach entails the omission of many interesting and important results (quite apart from defects in the selection due to errors of judgement on our part). Those results selected for inclusion are, however, proved in complete detail and without the assumption of any prior knowledge on the part of the reader.

This text bridges the gap between beginning and advanced calculus. It offers a systematic development of the real number system and careful treatment of mappings, sequences, limits, continuity, and metric spaces. 1963 edition.