Recurrence sequences are of great intrinsic interest and have been a central part of number theory for many years. Moreover, these sequences appear almost everywhere in mathematics and computer science. This book surveys the modern theory of linear recurrence sequences and their generalizations. Particular emphasis is placed on the dramatic impact that sophisticated methods from Diophantine analysis and transcendence theory have had on the subject. Related work on bilinear recurrences and an emerging connection between recurrences and graph theory are covered. Applications and links to other areas of mathematics are described, including combinatorics, dynamical systems and cryptography, and computer science. The book is suitable for researchers interested in number theory, combinatorics, and graph theory.

This self-contained text presents state-of-the-art results on recurrent sequences and their applications in algebra, number theory, geometry of the complex plane and discrete mathematics. It is designed to appeal to a wide readership, ranging from scholars and academics, to undergraduate students, or advanced high school and college students training for competitions. The content of the book is very recent, and focuses on areas where significant research is currently taking place. Among the new approaches promoted in this book, the authors highlight the visualization of some recurrences in the complex plane, the concurrent use of algebraic, arithmetic, and trigonometric perspectives on classical number sequences, and links to many applications. It contains techniques which are fundamental in other areas of math and encourages further research on the topic. The introductory chapters only require good understanding of college algebra, complex numbers, analysis and basic combinatorics. For Chapters 3, 4 and 6 the prerequisites include number theory, linear algebra and complex analysis. The first part of the book presents key theoretical elements required for a good understanding of the topic. The exposition moves on to to fundamental results and key examples of recurrences and their properties. The geometry of linear recurrences in the complex plane is presented in detail through numerous diagrams, which lead to often unexpected connections to combinatorics, number theory, integer sequences, and random number generation. The second part of the book presents a collection of 123 problems with full solutions, illustrating the wide range of topics where recurrent sequences can be found. This material is ideal for consolidating the theoretical knowledge and for preparing students for Olympiads.

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 textbook on periodic character and patterns of recursive sequences focuses on discrete periodic patterns of first order, second order and higher order difference equations. Aimed toward advanced undergraduate students and graduate students who have taken a basic course in Calculus I and Discrete Mathematics, this book serves as a core text for a course in Difference Equations and Discrete Dynamical Systems. The text contains over 200 exercises to provide readers with a hands-on experience working with the material; the exercises include computations of specific examples and proofs of general results. Readers will receive a first-hand introduction to patterns of periodic cycles and patterns of transient terms with exercises for most sections of the text, preparing them for significant research work in the area.

The book treats four mathematical concepts which play a fundamental role in many different areas of mathematics: symbolic sums, recurrence (difference) equations, generating functions, and asymptotic estimates. Their key features, in isolation or in combination, their mastery by paper and pencil or by computer programs, and their applications to problems in pure mathematics or to "real world problems" (e.g. the analysis of algorithms) are studied. The book is intended as an algorithmic supplement to the bestselling "Concrete Mathematics" by Graham, Knuth and Patashnik.

Polynomials are useful mathematical tools. They are simply defined and can be calculated quickly on computer systems. They can be differentiated and integrated easily and can be pieced together to form spline curves. After Weierstrass approximation Theorem, polynomial sequences have acquired considerable importance not only in the various branches of Mathematics, but also in Physics, Chemistry and Engineering disciplines. There is a wide literature on specific polynomial sequences. But there is no literature that attempts a systematic exposition of the main basic methods for the study of a generic polynomial sequence and, at the same time, gives an overview of the main polynomial classes and related applications, at least in numerical analysis. In this book, through an elementary matrix calculus-based approach, an attempt is made to fill this gap by exposing dated and very recent results, both theoretical and applied.