Arithmetic Functions

Every positive integer m has a product representation of the form where v, k and the ni are positive integers, and each Ei = ± I. A value can be given for v which is uniform in the m. A representation can be computed so that no ni exceeds a certain fixed power of 2m, and the number k of terms needed does not exceed a fixed power of log 2m. Consider next the collection of finite probability spaces whose associated measures assume only rational values. Let hex) be a real-valued function which measures the information in an event, depending only upon the probability x with which that event occurs. Assuming hex) to be non negative, and to satisfy certain standard properties, it must have the form -A(x log x + (I - x) 10g(I -x». Except for a renormalization this is the well-known function of Shannon. What do these results have in common? They both apply the theory of arithmetic functions. The two widest classes of arithmetic functions are the real-valued additive and the complex-valued multiplicative functions. Beginning in the thirties of this century, the work of Erdos, Kac, Kubilius, Turan and others gave a discipline to the study of the general value distribution of arithmetic func tions by the introduction of ideas, methods and results from the theory of Probability. I gave an account of the resulting extensive and still developing branch of Number Theory in volumes 239/240 of this series, under the title Probabilistic Number Theory.

"This monograph is devoted to arithmetic functions, an area of number theory. Arithmetic functions are very important in many parts of theoretical and applied sciences, and many mathematicians have devoted great interest in this field. One of the interesting features of this book is the introduction and study of certain new arithmetic functions that have been considered by the authors separately or together, and their importance is shown in many connections with the classical arithmetic functions or in their applications to other problems"--

This volume focuses on the classical theory of number-theoretic functions emphasizing algebraic and multiplicative techniques. It contains many structure theorems basic to the study of arithmetic functions, including several previously unpublished proofs. The author is head of the Dept. of Mathemati

This book is designed both for FPGA users interested in developing new, specific components - generally for reducing execution times –and IP core designers interested in extending their catalog of specific components. The main focus is circuit synthesis and the discussion shows, for example, how a given algorithm executing some complex function can be translated to a synthesizable circuit description, as well as which are the best choices the designer can make to reduce the circuit cost, latency, or power consumption. This is not a book on algorithms. It is a book that shows how to translate efficiently an algorithm to a circuit, using techniques such as parallelism, pipeline, loop unrolling, and others. Numerous examples of FPGA implementation are described throughout this book and the circuits are modeled in VHDL. Complete and synthesizable source files are available for download.

The theory of arithmetical functions has always been one of the more active parts of the theory of numbers. The large number of papers in the bibliography, most of which were written in the last forty years, attests to its popularity. Most textbooks on the theory of numbers contain some information on arithmetical functions, usually results which are classical. My purpose is to carry the reader beyond the point at which the textbooks abandon the subject. In each chapter there are some results which can be described as contemporary, and in some chapters this is true of almost all the material. This is an introduction to the subject, not a treatise. It should not be expected that it covers every topic in the theory of arithmetical functions. The bibliography is a list of papers related to the topics that are covered, and it is at least a good approximation to a complete list within the limits I have set for myself. In the case of some of the topics omitted from or slighted in the book, I cite expository papers on those topics.

The correlation of multiplicative arithmetic functions on distinct arithmetic progressions and with values in the complex unit disc, cannot be continually near to its possible maximum unless each function is either very close to or very far from a generalized character. Moreover, under accessible condition the second possibility can be ruled out. As a consequence analogs of the standard limit theorems in probabilistic number theory are obtained with the classical single additive function on the integers replaced by a sum of two additive functions on distinct arithmetic progressions.