Elementary number theory
TL;DR: The book as mentioned in this paper is designed for a first course in number theory with minimal prerequisites and is designed to stimulate curiosity about numbers and their properties, including almost a thousand imaginative exercises and problems.
Abstract: Designed for a first course in number theory with minimal prerequisites, the book is designed to stimulates curiosity about numbers and their properties. Includes almost a thousand imaginative exercises and problems.
Citations
More filters
TL;DR: An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time.
Abstract: An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings. The constant of proportionality is low enough to make this algorithm of practical use, and the procedure can also be extended to deal with some more general pattern-matching problems. A theoretical application of the algorithm shows that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time. Other algorithms which run even faster on the average are also considered.
3,156 citations
Book•
01 Jan 2001
TL;DR: The first 100 Lucas Numbers and their prime factorizations were given in this article, where they were shown to be a special case of the first 100 Fibonacci Numbers and Lucas Polynomials.
Abstract: Preface. List of Symbols. Leonardo Fibonacci. The Rabbit Problem. Fibonacci Numbers in Nature. Fibonacci Numbers: Additional Occurrances. Fibonacci and Lucas Identities. Geometric Paradoxes. Generalized Fibonacci Numbers. Additional Fibonacci and Lucas Formulas. The Euclidean Algorithm. Solving Recurrence Relations. Completeness Theorems. Pascal's Triangle. Pascal-Like Triangles. Additional Pascal-Like Triangles. Hosoya's Triangle. Divisibility Properties. Generalized Fibonacci Numbers Revisited. Generating Functions. Generating Functions Revisited. The Golden Ratio. The Golden Ratio Revisited. Golden Triangles. Golden Rectangles. Fibonacci Geometry. Regular Pentagons. The Golden Ellipse and Hyperbola. Continued Fractions. Weighted Fibonacci and Lucas Sums. Weighted Fibonacci and Lucas Sums Revisited. The Knapsack Problem. Fibonacci Magic Squares. Fibonacci Matrices. Fibonacci Determinants. Fibonacci and Lucas Congruences. Fibonacci and Lucas Periodicity. Fibonacci and Lucas Series. Fibonacci Polynomials. Lucas Polynomials. Jacobsthal Polynomials. Zeros of Fibonacci and Lucas Polynomials. Morgan-Voyce Polynomials. Fibonometry. Fibonacci and Lucas Subscripts. Gaussian Fibonacci and Lucas Numbers. Analytic Extensions. Tribonacci Numbers. Tribonacci Polynomials. Appendix 1: Fundamentals. Appendix 2: The First 100 Fibonacci and Lucas Numbers. Appendix 3: The First 100 Fibonacci Numbers and Their Prime Factorizations. Appendix 4: The First 100 Lucas Numbers and Their Prime Factorizations. References. Solutions to Odd-Numbered Exercises. Index.
1,250 citations
Book•
01 Jan 1976
TL;DR: In this paper, the authors present a theory of divisibility theory in the Integers, which is based on the Fermat Conjecture of the Quadratic Reciprocity Law.
Abstract: 1. Some Preliminary Considerations. 2. Divisibility Theory in the Integers. 3. Primes and Their Distribution. 4. The Theory of Congruences. 5. Fermat's Theorem. 6. Number-Theoretic Functions. 7. Euler's Generalization of Fermat's Theorem. 8. Primitive Roots and Indices. 9. The Quadratic Reciprocity Law. 10. Perfect Numbers. 11. The Fermat Conjecture. 12. Representation of Integers as Sums of Squares. 13. Fibonacci Numbers. 14. Continued Fractions. 15. Some Twentieth-Century Developments.
902 citations
01 Dec 1976
TL;DR: A simple description of pseudo-random sequences, or maximal-length shift-register sequences, and two-dimensional arrays of area n = 2lm- 1 with the same property.
Abstract: Binary sequences of length n = 2m- 1 whose autocorrelation function is either 1 or -1/n have been known for a long time, and are called pseudo-random (or PN) sequences, or maximal-length shift-register sequences. Two-dimensional arrays of area n = 2lm- 1 with the same property have rcently been found by several authors. This paper gives a simple description of such sequences and arrays and their many nice properties.
774 citations
TL;DR: It is proved that under the protocol designed, for a connected network, average consensus can be achieved with an exponential convergence rate based on merely one bit information exchange between each pair of adjacent agents at each time step.
Abstract: Communication data rate and energy constraints are important factors which have to be considered when investigating distributed coordination of multi-agent networks. Although many proposed average-consensus protocols are available, a fundamental theoretic problem remains open, namely, how many bits of information are necessary for each pair of adjacent agents to exchange at each time step to ensure average consensus? In this paper, we consider average-consensus control of undirected networks of discrete-time first-order agents under communication constraints. Each agent has a real-valued state but can only exchange symbolic data with its neighbors. A distributed protocol is proposed based on dynamic encoding and decoding. It is proved that under the protocol designed, for a connected network, average consensus can be achieved with an exponential convergence rate based on merely one bit information exchange between each pair of adjacent agents at each time step. An explicit form of the asymptotic convergence rate is given. It is shown that as the number of agents increases, the asymptotic convergence rate is related to the scale of the network, the number of quantization levels and the ratio of the second smallest eigenvalue to the largest eigenvalue of the Laplacian of the communication graph. We also give a performance index to characterize the total communication energy to achieve average consensus and show that the minimization of the communication energy leads to a tradeoff between the convergence rate and the number of quantization levels.
504 citations
References
More filters
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Abstract: Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper suggests ways to solve these currently open problems. It also discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
14,980 citations
Book•
01 Jan 1976
TL;DR: The Mathematics 160 course at the California Institute of Technology as discussed by the authors was the first volume of a two-volume textbook which evolved from a course (Mathematics 160) offered at the University of California during the last 25 years.
Abstract: This is the first volume of a two-volume textbook which evolved from a course (Mathematics 160) offered at the California Institute of Technology during the last 25 years. It provides an introduction to analytic number
theory suitable for undergraduates with some background in advanced calculus, but with no previous knowledge of number theory. Actually, a great deal of the book requires no calculus at all and could profitably be studied by sophisticated high school students.
Number theory is such a vast and rich field that a one-year course cannot do justice to all its parts. The choice of topics included here is intended to provide some variety and some depth. Problems which have fascinated generations of professional and amateur mathematicians are discussed
together with some of the techniques for solving them.
One of the goals of this course has been to nurture the intrinsic interest that many young mathematics students seem to have in number theory and to open some doors for them to the current periodical literature. It has been
gratifying to note that many of the students who have taken this course during the past 25 years have become professional mathematicians, and some have made notable contributions of their own to number theory. To all of
them this book is dedicated.
3,608 citations
TL;DR: The continued fraction method for factoring integers, introduced by D. H. Lehmer and R. E. Powers, is discussed along with its computer implementation in this paper, and the power of the method is demonstrated by the factorization of the seventh Fermat number F7 and other large numbers of interest.
Abstract: The continued fraction method for factoring integers, which was introduced by D. H. Lehmer and R. E. Powers, is discussed along with its computer implementation. The power of the method is demonstrated by the factorization of the seventh Fermat number F7 and other large numbers of interest. "Quand on a a' etudier un grand nombre, il faut commencer par en determiner quelques residus quadratiques." M. Kraitchik
206 citations
Book•
01 Dec 1978
TL;DR: In this paper, the authors present an introduction to higher algebra for students with a background of a year of calculus, aiming to give these students enough experience in the algebraic theory of the integers and polynomials to appreciate the basic concepts of abstract algebra.
Abstract: This is an introduction to higher algebra for students with a background of a year of calculus. The book aims to give these students enough experience in the algebraic theory of the integers and polynomials to appreciate the basic concepts of abstract algebra. The main theoretical thread is to develop algebraic properties of the ring of integers: unique factorization into primes; congruences and congrunce classes; Fermat's theorem; the Chinese remainder theorem; and for the ring of polynomials. Concurrently with the theoretical development, the book presents a broad variety of applications, to cryptography, error-correcting codes, Latin squares, tournaments, techniques of integration and especially to elementary and computational number theory. Many of the recent advances in computational number theory are built on the mathematics which is presented in this book. Thus the book may be used as a first course in higher algebra, as originally intended, but may also serve as an introduction to modern computational number theory, or to applied algebra.
138 citations
9 citations